Binary GCD algorithm
The binary GCD algorithm, also known as Stein's algorithm, is an algorithm that computes the greatest common divisor 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 was first published by the Israeli physicist and programmer Josef Stein in 1967, it may have been known in 1st-century China.
Wikipage disambiguates
Wikipage redirect
primaryTopic
Binary GCD algorithm
The binary GCD algorithm, also known as Stein's algorithm, is an algorithm that computes the greatest common divisor 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 was first published by the Israeli physicist and programmer Josef Stein in 1967, it may have been known in 1st-century China.
has abstract
Der steinsche Algorithmus oder ...... eichenbehafteten Integertypen.
@de
The binary GCD algorithm, also ...... en known in 1st-century China.
@en
Бинарный алгоритм Евклида — ме ...... 1),
* НОД(-m, n) = НОД(m, n)
@ru
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
724,237,685
hypernym
type
comment
Der steinsche Algorithmus oder ...... .
* , falls a und b ungerade.
@de
The binary GCD algorithm, also ...... en known in 1st-century China.
@en
Бинарный алгоритм Евклида — ме ...... 1),
* НОД(-m, n) = НОД(m, n)
@ru
label
Binary GCD algorithm
@en
Steinscher Algorithmus
@de
Бинарный алгоритм вычисления НОД
@ru
