Question

Cryptography Computer Security

Greatest Common Divisor Assignment

Instructions

In software, implement the Euclidean algorithm to find the greatest common divisor of any two positive integers. It should implement the pseudocode provided in the text. It should allow the user to enter two integers.   Your program should output the intermediate values of q, r1, r2 for each step and should return the greatest common divisor. Challenge component: Allow the user's input to be zero as well as the positive integers. Provide error checking and a response if the user enters a negative integer as input. This is an individual assignment. Upload the following. 1) a file of the code 2) screenshots of output for at least 4 pairs of inputs.

Answer 1

Here is the code written in C Program

gcd.c #include<stdio . h> int gcd(int a,int b) int q,r; while(b!-0) q-a/b; r-a-b*q; printf("q %d ,a-ed , b-%d , r-%d\n" , q ,a , b , r); b=r ; return a; int main) printf("In---GCD of 2 Numbers--.n") 0 int a,b; printf("nEnter Integer 1:"); scanf("%d",&a) ; printf("Enter Integer 2:" scanf("%d",&b); printf("Please enter non-negative integers\n"); else printf("GCD while(1); is : %d\n".gcd ( a, b));

Output of the file:

Enter Integer 1 :1 Enter Integer 2:6 GCD is :1 Enter Integer 1 :5 Enter Integer 2 :15 q-o,a-5,b-15,r-5 q=3 , a=15 , b=5, r=0 GCD is :5 Enter Integer 1:-5 Enter Integer 2 :15 Please enter non-negative integers Enter Integer 1 :0 Enter Integer 2 19 q-o,a-o,b-19,r-6 GCD is :19