anonymous
  • anonymous
In Lecture 3 - Problem Solving, the square root program that uses bi-section search algorithm doesn't enter the while loop for the value 4, instead it skips the loop and spits out the square root as 2.0 directly. Number of guesses = 0. Why is that?
MIT 6.00 Intro Computer Science (OCW)
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
Haha, figured out. Because it doesn't satisfy the conditions of the while loop. Before the loop begins we initialized ans to (high + low)/2.0 which equals 2.0, and the condition of the while loop first checks for ans^2 - x, which is 2^2 - 4 = 0. Since 0 is less than epsilon, the program doesn't enter the loop.
anonymous
  • anonymous
The code, if anyone wants to check.

Looking for something else?

Not the answer you are looking for? Search for more explanations.