Question: An algorithm to determine the greatest common divisor between two integers M and N is as follows: 1. Get input from user for the

An algorithm to determine the greatest common divisor between two integers M

An algorithm to determine the greatest common divisor between two integers M and N is as follows: 1. Get input from user for the first integer M 2. Get input from user for the second integer N 3. While M not equal to N repeat: if M > N: Replace value of M by M - N else N > M: Replace value of N by N - M 4. Display M 5. Stop Describe the algorithm above in a flowchart. [3 Marks]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

It seems like youve provided a description of an algorithm ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!