Assertion: euclidean algorithm | /r/Desires | less than o(hdivisions
Facets:
value: always
type: DEGREE
Source sentences:
text: Thus, the Euclidean algorithm always needs less than O(h) divisions, where h is the number of digits in the smaller number