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 ★

Comum · Saberes

Binary GCD algorithm

Algorithm that computes the greatest common divisor of two integers using only arithmetic shifts, comparisons, and subtraction

Texto em inglês

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.

Na Wikipédia

Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.

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.

Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Cmglee (CC BY-SA 3.0) ·

Cartas próximas

Abrir

…

Confirmação