which algorithm is the best and which one is the worst. Why?


Three different techniques to solve the GCD problem

1 Euclid’s algorithm

2 Consecutive integer checking algorithm .An algorithm based on the definition of GCD

3 Middle-school procedure .Prime factorization

From above which algorithm is the best and which one is the worst. Why?