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
-
H
How to Solve It
Book about problem solving
Nº Q4119391 ★★
Not listed
-
Euler's totient function
Function which gives the number of integers relatively prime to and not greater than its input
Nº Q190026 ★★★
Not listed
-
Steiner system
A type of block design, specifically a t-design with λ = 1 and t ≥ 2.
Nº Q4420916 ★
Not listed
-
GIF
Bitmap image file format family
Nº Q2192 ★★★
Not listed
-
Ones' complement
Value obtained by inverting all the bits in the binary representation of the number
Nº Q1361630 ★★
Not listed
-
Maximum subarray problem
The task of finding a contiguous subarray with the largest sum in a given array of numbers
Nº Q1334332 ★★
Not listed
-
G
Gabriel Andrew Dirac
Hungarian mathematician
Nº Q1007178 ★
Not listed
-
B
BIRCH
Clustering algorithm
Nº Q4835721 ★★
Not listed
-
E
Exponential backoff
Rate-seeking algorithm
Nº Q1417920 ★★
Not listed
-
On-Line Encyclopedia of Integer Sequences
Online database of integer sequences
Nº Q728415 ★★★
Not listed
-
E
Elliott–Halberstam conjecture
On the distribution of prime numbers in arithmetic progressions
Nº Q2993296 ★
Not listed
-
Contact binary
Binary star system whose component stars are very close
Nº Q2716249 ★
Not listed
-
Newton's method
Algorithm for finding a zero of a function
Nº Q374195 ★★★
Not listed
-
Arithmetical hierarchy
Hierarchy which classifies certain sets based on the complexity of formulas that define them
Nº Q669094 ★
Not listed
-
S
Synthetic geometry
Study of geometry without the use of coordinates or formulas.
Nº Q249148 ★
Not listed
-
Z
Zero-sum problem
Mathematical problem
Nº Q716171 ★
Not listed
-
Data Encryption Standard
Early unclassified symmetric-key block cipher
Nº Q135035 ★★
Not listed
-
S
Steve Wilhite
American theoretical computer scientist (1948–2022)
Nº Q7614306 ★
Not listed