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
-
D
Dhrystone
Computer performance test
Nº Q1207761 ★
Sem ofertas
-
equação de Bellman
Necessary condition for optimality associated with dynamic programming
Nº Q1430750 ★★
Sem ofertas
-
S
Sturges's rule
Method to decide the number of bins
Nº Q125768330 ★★
Sem ofertas
-
Programação dinâmica
Um método para a construção de algoritmos para a resolução de problemas computacionais, em especial os de otimização combinatória
Nº Q380679 ★★★
Sem ofertas
-
FEAL
Block cipher
Nº Q1388053 ★
Sem ofertas
-
Otsu's method
Automatic image thresholding method
Nº Q2444417 ★★
Sem ofertas
-
Busca dicotômica
Nº Q5272532 ★★★
Sem ofertas
-
Método do gradiente conjugado
Nº Q1191895 ★★
Sem ofertas
-
F
Frank–Wolfe algorithm
Optimization algorithm
Nº Q2020318 ★
Sem ofertas
-
Ensaio de Bernoulli
Nº Q1077800 ★
Sem ofertas
-
M
Multiplicação por duplicação
Nº Q1346420 ★
Sem ofertas
-
L
LZW
Nº Q2681 ★★★
Sem ofertas
-
Gzip
Nº Q283647 ★★★
Sem ofertas
-
Algoritmo Schönhage-Strassen
Nº Q1938391 ★
Sem ofertas
-
P
Problema da soma dos subconjuntos
Nº Q1154420 ★★
Sem ofertas
-
Lei de Benford
Nº Q817168 ★★★
Sem ofertas
-
Z
Zstandard
Nº Q26737171 ★★
Sem ofertas
-
Método de Euler
Método de integração numérica
Nº Q868454 ★★★
Sem ofertas