Use Euclid's Algorithm to calculate GCD(1424, 3084), 30841424 3084 2.1424 +236 1424 6.236 +8 236 29.8+4...

Transcribed Image Text:

Use Euclid's Algorithm to calculate GCD(1424, 3084), 30841424 3084 2.1424 +236 1424 6.236 +8 236 29.8+4 8=2.4+0 GCD (1424, 3084) = 4 Draw your flowchart for finding the GCD of X and Y. You may assume X is the smaller integer. Write your pseudo-code for the above flowchart. Use Euclid's Algorithm to calculate GCD(1424, 3084), 30841424 3084 2.1424 +236 1424 6.236 +8 236 29.8+4 8=2.4+0 GCD (1424, 3084) = 4 Draw your flowchart for finding the GCD of X and Y. You may assume X is the smaller integer. Write your pseudo-code for the above flowchart.