Highest common factor algorithm in c

// C program to find GCD of two numbers
#include <stdio.h>
 
// Recursive function to return gcd of a and b
int gcd(int a, int b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
}
 
// Driver program to test above function
int main()
{
    int a = 98, b = 56;
    printf("GCD of %d and %d is %d ", a, b, gcd(a, b));
    return 0;
}

Source: geeksforgeeks.org

Similar codes

341 votes176 views5 answers
How can i remove a specific item from an array
C
0 vote133 views1 answer
Sh: tailwindcss: command not found
C
4 votes86 views2 answers
Remove character from string c
C
0 vote134 views1 answer
Change no_turbo
C
3 votes91 views2 answers
Open folder in mac
C
0 vote138 views1 answer
How we can strore a nested structure values in arrays
C
1 vote119 views2 answers
C vs c
C
2 votes88 views1 answer
Vscode arduino [Warning] Output path is not specified. Unable to reuse previously compiled files. Upload could be slow. See README.
C
0 vote146 views1 answer
Malloc contiguous 2d array
C
7 votes184 views5 answers
Sleep function in c
C