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 Algorithms: Sorting and Searching Searching Names Binary Search

Kris Reid
Kris Reid
17,026 Points
Posted by Kris Reid
Kris Reid
17,026 Points

Binary Search - new midpoint?

I'm just wondering. I'm looking at implanting a binary search. I understand it mostly. However is a new midpoint created after discarding half of the list or does it just continue searching the list?

Hope that makes sense thanks.

1 Answer

Kevin S
seal-mask
.a{fill-rule:evenodd;}techdegree
Kevin S
Data Analysis Techdegree Student 15,862 Points
Kevin S
.a{fill-rule:evenodd;}techdegree
Kevin S
Data Analysis Techdegree Student 15,862 Points

Yo Kris,

I'm still working though binary search myself, but maybe this video will help you out. It's from Harvard, and I think it does a great job of explaining binary serach step by step.

https://www.youtube.com/watch?v=T98PIp4omUA

Hope this points you in the right direction.