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
-
G★
Gilbert–Johnson–Keerthi distance algorithm
Method of determing minimum distance between two convex sets
-
Q★
Quadratic unconstrained binary optimization
Combinatorial optimization problem
-
★
Pohlig–Hellman algorithm
Algorithm for computing discrete logarithms
-
B★
Bailey–Borwein–Plouffe formula
Formula for calculating π
-
K★
Kabsch algorithm
Type of algorithm
-
★★★
Common logarithm
The logarithm with base 10, formerly widely used for calculations
-
★
Gnome sort
Sorting algorithm
-
★★★★
Dijkstra's algorithm
Graph search algorithm
-
★
Simon Plouffe
Canadian mathematician
-
P★
Partition problem
NP-complete problem in computer science
-
★★
Grover's algorithm
Quantum unstructured search algorithm that finds with high probability the unique input to a black box function that produces a particular output value using 𝑂(𝑁) evaluations
-
★★★★
Quicksort
Divide and conquer sorting algorithm
-
★★
Binary space partitioning
Method for recursively subdividing a space into two subsets using hyperplanes
-
K★★★★
Kaprekar's routine
Iterative algorithm
-
★
Bernstein–Vazirani algorithm
Quantum algorithm
-
G★
Gauss–Legendre algorithm
Quadratically converging iterative algorithm for computing π
-
P★
Pollard's kangaroo algorithm
Algorithm for computing the discrete logarithm
-
B★
Brent's method
Root-finding algorithm