 Thus, "N" ≤ 5 log10"b".Thus, the Euclidean algorithm always needs less than "O"("h") divisions, where "h" is the number of digits in the smaller number "b".The average number of steps taken by the Euclidean algorithm has been defined in three different ways.