Welcome to the Treehouse Community

Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.

Start your free trial

Computer Science Introduction to Algorithms Algorithms in Code Recursive Binary Search

Eva Feng
Eva Feng
1,468 Points
Posted by Eva Feng
Eva Feng
1,468 Points

Recursive binary search

The code produces a different result if a change the last line to midpoint - 1, why is that? if list[midpoint] == target: return True else: if list[midpoint] < target: return recursive_binary_search(list[midpoint+1:], target) else: return recursive_binary_search(list[:midpoint], target)

1 Answer

Steven Parker
Steven Parker
243,200 Points
Steven Parker
Steven Parker
243,200 Points

Code by its very nature is a very specific set of instructions for the computer to follow. If you change any of the instructions that get executed during a run, it will almost always cause a different result.

In future questions, when posting code, use Markdown formatting to preserve the code's appearance and retain special symbols.