A shift-remainder GCD algorithm

  • Graham Norton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 356)


This paper studies an integer greatest common divisor algorithm which uses a "shift-divide" instruction to compute the gcd of two integers u, v. If u > v, the worst case run-time is [log2v]+1, and for uniformly distributed integers in the range [0,u-1] , the average run-time is experimentally 0.555 ln u.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [B]
    Brent, R.P. Analysis of the Binary Euclidean Algorithm. In Algorithms and Complexity, J. Traub ed., p. 321–355. Academic Press, New York, 1976.Google Scholar
  2. [K]
    Knuth, D.E. The Art of Computer Programming. Vol. 2(Second Edition), Addison-Wesley, Reading, Massachusetts, 1981.Google Scholar
  3. [N]
    Norton, G.H. A Unified Design and Analysis of Some GCD Algorithms. Preprint, Sept. 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Graham Norton
    • 1
  1. 1.Laboratoire d'Analyse Numérique, MathématiquesUniversité Paul SabatierToulouseFrance

Personalised recommendations