The computing time of the Euclidean algorithm.

  • Authors:

  • George E. Collins

  • Affiliations:

  • -

  • Venue:
  • The computing time of the Euclidean algorithm.
  • Year:
  • 1973

Quantified Score

Hi-index 0.00

Visualization

Abstract

The maximum, minimum and average computing times of the classical Euclidean algorithm for the greatest common divisor of two integers are derived, to within codominance, as functions of the lengths of the two inputs and the output.