Which algorithm is the most efficient numerical algorithm to obtain lcm?
(a) Euler’s Algorithm
(b) Euclid’s Algorithm
(c) Chebyshev Function
(d) Partial Division Algorithm
I had been asked this question in class test.
Query is from GCD LCM recursion topic in division Recursion of Data Structures & Algorithms II