So, I'm having some difficulty understanding bisection searching...
When a computer is using brute force to find an answer to a problem it goes through each possible choice, correct?
So bisection searching is completed when you write code to limit the search space? What does this code look like? I was confused by the instructors example.

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Looking for something else?

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

## More answers

Looking for something else?

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