Data Structure
Java
Python
HTML
Interview Preparation
- Interview Prep
- Tutorials
- Tracks
GATE | CS | 2004 | C Programming | Loops & Conditionals | Question 42
Last Updated :
Discuss
Comments
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).
log m
m2
m1/2
m1/3
This question is part of this quiz :
Top MCQs on Algorithms in DSA with Answers,GATE-CS-2004,Loops & Conditionals GATE CS PYQ QuizShare your thoughts in the comments
GeeksforGeeks