GATE | GATE-CS-2004 | Question 42

What does the following algorithm approximate?

x = m;
y = 1;
while (x - y > e)
{
    x = (x + y)/2;
    y = m/x;
}
print(x);

(Assume m > 1, e > 0).

(A) log m
(B) m²
(C) m^1/2
(D) m^1/3

Answer: (C)
Explanation: The given code is implementation of Babylonian method for square root
Quiz of this Question