Affiliation:
1. Australian National University, Canberra, Australia
Abstract
The binary Euclidean algorithm finds the GCD of two integers u and v using subtraction, shifting and parity testing. Unlike the classical Euclidean algorithm, no divisions are required. We analyse a continuous model of the binary algorithm, and find the expected number of iterations.
Publisher
Association for Computing Machinery (ACM)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献