Write a program to find LCM of two number

Write a program to find LCM of two number
using function

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

Recursion recursion

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