GCD Algorithm(Greatest Common Divisor)

最新推荐文章于 2022-10-03 20:31:52 发布

so1ene

最新推荐文章于 2022-10-03 20:31:52 发布

阅读量440

点赞数

CC 4.0 BY-SA版权

分类专栏： algorithm 文章标签：算法 gcd

本文链接：https://blog.youkuaiyun.com/so1ene/article/details/53747863

algorithm 专栏收录该内容

0 篇文章

订阅专栏

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=minNum;
		minNum=remainder;
		remainder=maxNum%minNum;
	}
	return minNum;
}

//改进：%运算耗时；考虑位运算，用奇偶判断及减代替模运算;

int GCD(int left,int right){
	if(left==right)
		return left;
	if(left<right)
		return GCD(right,left);
	if(!(left&1)&&!(right&1))
		return GCD(right>>1,left>>1)<<1;
	if(!(left&1)&&(right&1))
		return GCD(left>>1,right);
	if((left&1)&&!(right&1))
		return GCD(left,right>>1);
	return GCD(left-right,left);
}