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
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
-
Grafo bipartido
Nº Q174733 ★★
Sem ofertas
-
Crivo de Eratóstenes
Nº Q177898 ★★★
Sem ofertas
-
Weisfeiler Leman graph isomorphism test
Heuristic algorithm for testing whether two graphs are isomorphic
Nº Q113844288 ★
Sem ofertas
-
Aproximação diofantina
Nº Q1227061 ★★
Sem ofertas
-
W
Whittaker–Shannon interpolation formula
Signal (re-)construction algorithm
Nº Q2018853 ★
Sem ofertas
-
m
método de Halley
Method of numerically finding roots of a function
Nº Q1476051 ★
Sem ofertas
-
A
Aritmomania
Transtorno mental
Nº Q748104 ★★
Sem ofertas
-
S
Short division
Way to break a division problem into smaller steps
Nº Q105834438 ★★
Sem ofertas
-
Duplicação do cubo
Um problema de geometria
Nº Q213673 ★★
Sem ofertas
-
T
Top-p sampling
Language model technique
Nº Q122237668 ★
Sem ofertas
-
Identidade de Euler
Nº Q204819 ★★★
Sem ofertas
-
Árvore binária de busca
Nº Q623818 ★★
Sem ofertas