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
-
Geohash
Similarity-hashing function invented in 2008, specific for geographic coordinates compressing or for location clustering
Nº Q3101207 ★★
Sem ofertas
-
Range coding
Entropy coding method defined by G. Nigel N. Martin in a 1979 paper, which effectively rediscovered the FIFO arithmetic code first introduced by Richard Clark Pasco in 1976
Nº Q818947 ★
Sem ofertas
-
E
Exponentiation by squaring
Algorithm
Nº Q864127 ★★
Sem ofertas
-
E
Esquema de Horner
Nº Q944658 ★★
Sem ofertas
-
A-law algorithm
Algorithm
Nº Q278059 ★
Sem ofertas
-
F
Fibonacci coding
Universal code
Nº Q2633 ★★
Sem ofertas
-
F
Fórmula de Bellard
Nº Q1108664 ★
Sem ofertas
-
Kitagawa–Oaxaca–Blinder decomposition
Statistical method
Nº Q22907419 ★
Sem ofertas
-
Algoritmo de Euclides estendido
Nº Q1362750 ★★
Sem ofertas
-
Bi-quinary coded decimal
Numeral encoding scheme
Nº Q864961 ★
Sem ofertas
-
H
Held–Karp algorithm
Solution of the traveling salesman problem
Nº Q20203442 ★
Sem ofertas
-
B
Buddy memory allocation
Nº Q1001112 ★
Sem ofertas
-
B
Broyden–Fletcher–Goldfarb–Shanno algorithm
Optimization method
Nº Q2877013 ★
Sem ofertas
-
Algoritmo de Strassen
Nº Q728507 ★★
Sem ofertas
-
L
Lattice multiplication
Multiplication algorithm
Nº Q3516846 ★
Sem ofertas
-
G
Galois/Counter Mode
Authenticated encryption mode for block ciphers
Nº Q5519271 ★★★
Sem ofertas
-
t
teorema de Baker
Lower bound for absolute value of linear combinations of logarithms of algebraic numbers
Nº Q3527009 ★
Sem ofertas
-
Algoritmo de Borůvka
Nº Q1468211 ★
Sem ofertas