Common · Knowledge
Binary GCD algorithm
Algorithm that computes the greatest common divisor of two integers using only arithmetic shifts, comparisons, and subtraction
The binary GCD algorithm, also known as Stein's algorithm or the binary Euclidean algorithm, is an algorithm that computes the greatest common divisor (GCD) of two nonnegative integers. Stein's algorithm uses simpler arithmetic operations than the conventional Euclidean algorithm; it replaces division with arithmetic shifts, comparisons, and subtraction.
From Wikipedia
The binary GCD algorithm, also known as Stein's algorithm or the binary Euclidean algorithm, is an algorithm that computes the greatest common divisor (GCD) of two nonnegative integers. Stein's algorithm uses simpler arithmetic operations than the conventional Euclidean algorithm; it replaces division with arithmetic shifts, comparisons, and subtraction. Although the algorithm in its contemporary form was first published by the physicist and programmer Josef Stein in 1967, it was known by the 2nd century BCE, in ancient China.
Text: Wikipédia, CC BY-SA 4.0. · Image: Cmglee (CC BY-SA 3.0) ·
Related cards
-
★★
Geohash
Similarity-hashing function invented in 2008, specific for geographic coordinates compressing or for location clustering
-
★
Range coding
Entropy coding method defined by G. Nigel N. Martin in a 1979 paper, which effectively rediscovered the FIFO arithmetic code first introduced by Richard Clark Pasco in 1976
-
E★★
Exponentiation by squaring
Algorithm
-
H★★
Horner's method
Algorithm for polynomial evaluation
-
★
A-law algorithm
Algorithm
-
F★★
Fibonacci coding
Universal code
-
B★
Bellard's formula
Mathematical formula
-
★
Kitagawa–Oaxaca–Blinder decomposition
Statistical method
-
★★
Extended Euclidean algorithm
Algorithm for computing the coefficients of Bézout's Identity
-
★
Bi-quinary coded decimal
Numeral encoding scheme
-
H★
Held–Karp algorithm
Solution of the traveling salesman problem
-
B★
Buddy memory allocation
Memory allocation algorithm
-
B★
Broyden–Fletcher–Goldfarb–Shanno algorithm
Optimization method
-
★★
Strassen algorithm
First subcubic matrix multiplication algorithm
-
L★
Lattice multiplication
Multiplication algorithm
-
G★★★
Galois/Counter Mode
Authenticated encryption mode for block ciphers
-
B★
Baker's theorem
Lower bound for absolute value of linear combinations of logarithms of algebraic numbers
-
★
Borůvka's algorithm
Algorithm for finding minimum spanning trees by repeatedly finding the shortest edge out of each subtree in a forest and adding all such edges to the forest