GCD Algorithm(Greatest Common Divisor)
Greatest Common Divisor:
//初版本:
int GCD(int left,int right){
int maxNum=left>right?left:right;
int minNum=left>right?right:left;
int remainder=maxNum%minNum;
while(remainder){
maxNum=minNu
原创
2016-12-19 20:21:37 ·
395 阅读 ·
0 评论