 This is exploited in the binary version of Euclid's algorithm.Combining the estimated number of steps with the estimated computational expense per step shows that the Euclid's algorithm grows quadratically ("h"2) with the average number of digits "h" in the initial two numbers "a" and "b".Let "h"0, "h"1, ..., "h""N"−1 represent the number of digits in the successive remainders "r"0, "r"1, ..., "r""N"−1.