The Computing Time of the Euclidean Algorithm
STANFORD UNIV CA DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
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.
- Theoretical Mathematics
- Computer Programming and Software