Concept drill

square-root

GATE CSE & IT · Number Theory & Algorithms · 2004-2004

PYQs

100%

keyed

elite explanations

years appeared

Study anchor

Cormen et al. — Introduction to Algorithms (CLRS)

Algorithms, data structures, graph algorithms, complexity

What does the following algorithm approximate? (Assume m > 1, $$ \in > 0$$) x = m; y = 1; while(x - y > ε){ x = (x + y) / 2; y = m/x; } print(x);