Here's the question you clicked on:
Corinos
Problem set 1: Bisection Search question: Can we use the two while loops like we did in the question before to solve this, or do we need to start from scratch?
- initialize variables - establish upper and lower bounds * guess the answer (1/2 way between upper and lower * perform computations * check the result and determine if the guess was too big or too small or just right * adjust one of the bounds as necessary * repeat if you can reuse code, great