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.
Nº Q622328 ★
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
-
B
Baby-step giant-step
Algorithm for solving the discrete logarithm problem
Nº Q797983 ★
Not listed
-
Ghost leg
Method of random selection
Nº Q1184644 ★★★
Not listed
-
Geoffrey Hinton
British-Canadian computer scientist and psychologist
Nº Q92894 ★★★★
Not listed
-
Bisection method
The method of finding a root in mathematics, based on repeated division of a segment in half and the subsequent selection of a subinterval in which the root is thought to be located.
Nº Q866300 ★★★
Not listed
-
C
Cox–Zucker machine
Algorithm in algebraic geometry
Nº Q228693 ★★
Not listed
-
Euclidean distance
Conventional distance in mathematics and physics
Nº Q847073 ★★★
Not listed
-
Z
Zsigmondy's theorem
On primes dividing the difference of nth powers of coprime integers, but not powers < n
Nº Q8074796 ★
Not listed
-
Dedekind cut
Method of construction of the real numbers
Nº Q851333 ★★
Not listed
-
D
Double counting (proof technique)
Technique for proving that two expressions are equal by showing that they both count the size of the same set
Nº Q1191750 ★
Not listed
-
Angle bisector theorem
Two segments that divide a triangle
Nº Q925854 ★★
Not listed
-
Ham sandwich theorem
Theorem that any three objects in space can be simultaneously bisected by a plane
Nº Q730222 ★★
Not listed
-
W
Witten conjecture
Conjecture in algebraic geometry
Nº Q8028565 ★
Not listed
-
V
Validated numerics
Numerics including mathematically strict error evaluation
Nº Q63307393 ★
Not listed
-
D
Divisor (algebraic geometry)
Eneralization of codimension-1 subvarieties of algebraic varieties
Nº Q909669 ★
Not listed
-
JPEG
Conflation of multiple topics including compression algorithms, various file formats, standards/technical specifications and a non-profit organisation
Nº Q2195 ★★★
Not listed
-
J
James–Stein estimator
Biased estimator for Gaussian random vectors, better than ordinary least-squared-error minimization
Nº Q6146297 ★
Not listed
-
R
Randomized algorithm
Algorithm designed to use randomness from auxiliary inputs as part of its logic
Nº Q583461 ★
Not listed
-
E
Elevator algorithm
Disk-scheduling algorithm
Nº Q988829 ★
Not listed