3 ms·
Still this is an issue with the algorithm, not the implementation. http://en.wikipedia.org/wiki/Euclidean_algorithm http://en.wikipedia.org/wiki/Euclidean_algo
by feliperibeiro 12y ago
Still this is an issue with the algorithm, not the implementation.
http://en.wikipedia.org/wiki/Euclidean_algorithm http://en.wikipedia.org/wiki/Euclidean_algorithm
- conistonwater 12y agoI think you misunderstood the Euclidean algorithm. The basic iteration is of the form gcd(a, b) = gcd(b, a mod b), and there is no need to compute mod with anything other than %.
- feliperibeiro 12y agoYou're right. This is the subtraction-based implementation, the division-based is the original and better one :) https://github.com/felipernb/algorithms.js/commit/e5a04f9ad07256ef5cd86aa2fc772dc713381de3 https://github.com/felipernb/algorithms.js/commit/e5a04f9ad0...