我试图找到最大的共同因素。
我写了一个错误的(操作密集)算法,它降低一个低值,用%来检查它是否均衡地将分子和分母分隔开来,如果它这样的话,它就会退出程序。然而,我当时的循环没有使用该和操作员,因此,一旦该分子可以分辨,它就停止了,即使它不是正确的答案。
我使用的数字是54和42,正确的GCD(最大公分母)是6。
#heres a simple algorithm to find the greatest common denominator:
iterations = 0; #used to calculate number of times while loop is executed
u = 54; v= 42; d = v-1; #u is the numerator, v is the denominator, d is the number decremented by one
while ((v % d !=0) & (u % d != 0)): #while both numerator AND denominator cannot be evenly divided by the decremented number
d -= 1 #decrement the number by one
print d #print the number decremented
iterations +=1 #add 1 to the count of iterations in while loop
print "the gcd is " +str(d) #should be 6 when the number can evenly divide both
print "the number of iterations was " +str(iterations) #display times it took algorithm to complete
我得到的答案是27,它告诉我,一旦它达到27岁,并且可以平均地将54/27分开,它就停止了。
谢谢!