Question

8. Draw the flow chart for the following piece of code. int main(void) { int u, v, temp; printf("Enter two non negative numbers: "); scanf("%d %d", &u, &v); while (v != 0) { temp = u % v; u = v; v = temp; } printf("Greatest Common Divisor is %d", u); return 0; }

          8. Draw the flow chart for the following piece of code.
int main(void)
{
int u, v, temp;
printf("Enter two non negative numbers: ");
scanf("%d %d", &u, &v);
while (v != 0)
{
temp = u % v;
u = v;
v = temp;
}
printf("Greatest Common Divisor is %d", u);
return 0;
}

8. Draw the flow chart for the following piece of code.
int main(void)

int u, v, temp;
printf("Enter two non negative numbers: ");
scanf("%d %d", &u, &v);
while (v != 0)

temp = u % v;
u = v;
v = temp;

printf("Greatest Common Divisor is %d", u);
return 0;

Added by Daniel A.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Darrick Lau

Step 1

Start the program. Show more…

Show all steps

Thanks for your feedback!

Title: Flow Chart for Finding the Greatest Common Divisor int main(void) { int u, v, temp; printf("Enter two non-negative numbers: "); scanf("%d %d", &u, &v); while(v != 0) { temp = u % v; u = v; v = temp; } printf("Greatest Common Divisor is %d", u); return 0; }