Write a program to find GCD of two number

Write a program to find GCD of two number.
using function

1. #include<stdio.h>
2. int find_gcd(int n1, int n2);
3. 
   
4. int main() {
5.     int n1, n2;
6.     printf("Enter two numbers to find GCD : ");
7.     scanf("%d %d", & n1, & n2);
8.     
9.     printf("\n%d and %d of GCD is: %d\n\n", n1, n2, find_gcd(n1, n2));
10.  
11.     return 0;
12.  }
13. int find_gcd(int n1, int n2) {
14.   if (n2 == 0)
15.     return n1;
16.   else
17.     return find_gcd(n2, n1 % n2);
18. }

Using recursion 

1. #include<stdio.h>
2. 
   
3. int find_gcd(int , int );
4. 
   
5. int main()
6. {
7.     int n1, n2, gcd;
8.     printf("Enter two numbers to find GCD : ");
9.     scanf("%d%d", &n1, &n2);
10.     
11.     gcd = find_gcd(n1, n2);
12.     printf("\n%d and %d of GCD is: %d\n\n", n1, n2, gcd);
13. 
    
14.     return 0;
15. }
16. 
    
17. int find_gcd(int x, int y)
18. {
19.     if(x > y)
20.         find_gcd(x-y, y);
21. 
    
22.     else if(y > x)
23.         find_gcd(x, y-x);
24.     else
25.         return x;
26. }