Euclid’s algorithm is used to find GCD of two numbers.
There are mainly two versions of algorithm.
Version 1 (Using subtraction)
Version 2 (Using modulo operator)
Which of the above two is more efficient?
Version 1 can take linear time to find the GCD, consider the situation when one of the given numbers is much bigger than the other. Version 2 is obviously more efficient as there are less recursive calls and takes logarithmic time.
Consider a situation where modulo operator is not allowed, can we optimize version 1 to work faster?
Below are some important observations. The idea is to use bitwise operators. We can find x/2 using x>>1. We can check whether x is odd or even using x&1.
gcd(a, b) = 2*gcd(a/2, b/2) if both a and b are even.
gcd(a, b) = gcd(a/2, b) if a is even and b is odd.
gcd(a, b) = gcd(a, b/2) if a is odd and b is even.
Below is C++ implementation.
This article is compiled by Shivam Agrawal. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
- Minimize the value of N by applying the given operations
- Operations on Sparse Matrices
- Minimum bitwise operations to convert given a into b.
- Implement *, - and / operations using only + arithmetic operator
- Find maximum operations to reduce N to 1
- Minimum gcd operations to make all array elements one
- Count operations of the given type required to reduce N to 0
- Computing INT_MAX and INT_MIN with Bitwise operations
- Maximum value in an array after m range increment operations
- Minimum operations to make GCD of array a multiple of k
- Minimum operations required to change the array such that |arr[i] - M| <= 1
- Minimum number of operations required to reduce N to 1
- Online Queries for GCD of array after divide operations
- Levelwise Alternating OR and XOR operations in Segment Tree
- Minimum number operations required to convert n to m | Set-2