Assertion: algorithm | /r/CapableOf | grow with average number of digits
Facets:
value: quadratically
type: MANNER
value: in the initial two numbers
type: LOCATION
Source sentences:
text: Combining the estimated number of steps with the estimated computational expense per step shows that the Euclid's algorithm grows quadratically (h2) with the average number of digits h in the initial two numbers a and b. Let h 0 , h 1 , ...