| Webster's Online Dictionary |
| Expressions | Definition | ||
| Binary GCD algorithm | The binary GCD algorithm is an algorithm which computes the greatest common divisor of two positive integers. It gains a measure of efficiency over the ancient Euclidean algorithm by avoiding divisions and replacing them with bitwise operations that are cheaper when operating on the binary representation used by modern computers. This is particularly critical on embedded platforms that have no direct processor support for division. While the algorithm was first published in modern times by Josef Stein in 1967, it may have been known in first century China (Knuth, 1998). (references) | ||
Source: compiled by the editor from various references; see credits. | Top | ||
| Expressions | Domain | Definition | |
| Binary GCD algorithm | Math | Compute the greatest common divisor of two integers expressed in binary. The run time complexity is O ((log2 uv)2) bit operations. (references) | |
Source: compiled by the editor from various references; see credits. | Top | ||
