Welcome to the Treehouse Community

The Treehouse Community is a meeting place for developers, designers, and programmers of all backgrounds and skill levels to get support. Collaborate here on code errors or bugs that you need feedback on, or asking for an extra set of eyes on your latest project. Join thousands of Treehouse students and alumni in the community today. (Note: Only Treehouse students can comment or ask questions, but non-students are welcome to browse our conversations.)

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and a supportive community. Start your free trial today.

Computer Science Introduction to Algorithms Algorithms in Code Binary Search in Code

Simohamed ALAOUI
Simohamed ALAOUI
3,580 Points

🤔Im still confused about this part 👉 last = len(list)- 1.

If we deduct 1, we get the 3rd position which is the number 4 (i was thinking why we don't add 1 instead of deducting 1. Please Help!

1 Answer

Steven Parker
Steven Parker
211,076 Points

Since index values begin at 0 instead of 1, the highest possible index (and the index of the last item) is one less than the number of items in the list.