Euclid Greatest Common Divisor-GCD - 欧几里得 最大公约数

#include <stdio.h>
#include <stdlib.h>
/*
  Name: GCD 
  Copyright: 
  Author: yilonglucky
  Date: 29-07-11 15:40
  Description:return the Greatest Common Divisor 
              no matter a is bigger or b
              you should call EITHER of them below
*/
//non-recursion 
unsigned int gcd(unsigned int a,unsigned int b){
    int r;
    while(b>0){
        r=a%b;
        a=b;
        b=r;
    }
    return a;
}

//recursion 
unsigned int gcd(unsigned int a,unsigned int b){
    return (b>0)?gcd(b,a%b):a; 
}
        
int main(int argc, char *argv[])
{
  printf("%d\n",gcd(2740,1760));
  getchar();
  system("PAUSE");	
  return 0;
}