Turning Bisection Square Root Into a Reusable Function

How does wrapping a working bisection-root loop in a function that returns its answer let you reuse it to brute-force a brand-new counting problem?

Finger exercises

Short drills on what this video just taught. Write the code, run the checks, and reveal the answer only if you are stuck.

0 / 5 passed

Exercise 1 of 5

Return the next guess

Bisection improves its guess by jumping to the midpoint of the current low and high endpoints. Wrap that single step in a function that returns the new guess (so a caller can reuse the value — don't print it).

Name the function next_guess and give it two inputs, low and high.

# Complete the body so the function RETURNS the new guess (don't print it).
def next_guess(low, high):
    ...  # your code here — return the midpoint of low and high

# Complete the body so the function RETURNS the new guess (don't print it).
def next_guess(low, high):
    ...  # your code here — return the midpoint of low and high

Python runs in your browser

⌘/Ctrl + Enter runs

is a function

returns a number instead of printing one

lands halfway between the two endpoints

←Previous return vs. print, and the Hidden None That Reveals a Bug Next Environments and Scope: The Rule Behind UnboundLocalError →