Euclid’s algorithm
Euclid’s algorithm for efficiently computing the greatest common divisor of two integers.
PseudoCode:
Eucilid(a, b)
if b == 0
return a
else return Eucilid(b, a mod b)
}
Previous
Divide Two Integers
LeetCode Q 29 - Divide Two IntegersGiven two integers dividend and divisor, divide two integers without using multiplica
2019-04-08
Next
Permutation Sequence
LeetCode Q 60 - Permutation SequenceThe set [1,2,3,…,n] contains a total of n! unique permutations.
By listing and label
2019-04-08