Abstract: Taking a new approach, we have analysed the time complexity of Euchd's algorithm for computing the greatest common divisor of two positive integers The conctusion is: Let l(m, n) denote the numbet of iterations of execution of Euclid's algorithm upon input data m and n. Then l(m, n)<log; (m.n), provided that not both m and n are l's.