Question

Functions & Arrays Q1) The greatest common divisor (GCD) of two Integers (of which at least one is nonzero) is the largest positive integer that divides the numbers. Write a C function ged that accepts two integers and returns 1 if both the integers are zero, otherwise it returns their GCD. Write a C program (that includes the function ged) which accepts two integers and prints their GCD. Sample output: Enter two integers: 0 0 At least one number must be nonzero Enter two integers: 0-4 GCD of O and -4 is 4 Enter two integers: 128 GCD of 16 and 8 is 4 Enter two integers: 168 GCD of 16 and 8 is 8

coding in c programming

Answer 1

Code :

#include <stdio.h>

int gcd(int a, int b){ //functiom that take two number as input and return gcd of these two number
if(a==0 && b==0){ //checking case when both number is zero
return -1;
}

if (a == 0) {
if(b<0){
return -b;
}
else{
return b;
}   
}

if (b == 0){
if(a<0){
return -a;
}
else{
return a;
}
}

return gcd(b,a%b); //recursive calling again calling gcd

}

int main() {

int num1,num2,res;
printf("Enter two number: "); //taking input from users
scanf("%d%d",&num1,&num2);

res = gcd(num1,num2); //calling gcd function

if(res!=-1){
printf("GCD of %d and %d is %d\n",num1,num2,res);//printing gcd of two number
}
else{
printf("At least one number must be nonzero\n");//printing message when both number are zero
}
return 0;

}

Screenshot :

Code :

1 2 HomeworkLib.c #include <stdio.h> int gcd(int a, int b){ //function that take two number as input and return god of these two number if(a==0 && b==0){ // checking case when both number is zero return -1; 4 5 بہا if (a == 0) { if(b<o){ return -b; } else{ return b; بہا 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 فہ if (b == 0){ if(a<6){ return -a; } else{ return a; نہا ہا return gcd(b,a%b); //recursive calling again calling ged } int main() { int num1, num2,res; printf("Enter two number: "); //taking input from users scanf("%d%d",&num1, &num2); 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44. 45 46 res = gcd(num1, num2); //calling gcd function if(res!=-1){ printf("GCD of %d and %d is %d\n", num1, num2,res);//printing gcd of two number } else{ printf("At least one number must be nonzero\n");//printing message when both number are zero } return 0;

Output:

C:\Users\karju\Documents\HomeworkLib.exe Enter two number: 00 At least one number must be nonzero Process exited after 12.27 seconds with return value o Press any key to continue

C:\Users\karju\Documents\HomeworkLib.exe Enter two number: 16 8 GCD of 16 and 8 is 8 Process exited after 6.697 seconds with return value o Press any key to continue