Öklid Algoritması ile Ebob bulma

gistfile1.c

#include <stdio.h>

/*
ebob(m, n) = ebob(n, m mod n) 

while n != 0
    r ‹ m mod n
    m ‹ n
    n ‹ r
return m

*/

int main(void) {
	
	int Number1,Number2;
	printf("Number1: ");
	scanf("%d",&Number1);
	printf("Number2: ");
	scanf("%d",&Number2);
	printf("\n\nEBOB(Greatest Common Divisor) : %d",IterativeGCD(Number1,Number2));
	printf("\n\nRecursive olarak EBOB: %d",RecursiveGCD(Number1,Number2));
	return 0;
}

int IterativeGCD(int Number1, int Number2)
{
	int tempt;

	while(Number2!=0)
	{
		tempt = Number1 % Number2;
		Number1 = Number2;
		Number2 = tempt;	
	}
	
	return Number1;
}

int RecursiveGCD(int Number1, int Number2)
{
	if(Number2 == 0)
	{
		return Number1;
	}
	else
	{
		return RecursiveGCD(Number2,Number1%Number2);
	}
}