Binary Search Algorithm in Python

Here we look at Binary Search, and how it compares to linear search. Binary search works by searching at the middle value, and seeing if it's smaller or greater than the value we are searching for. It then segments the list and repeats and finishes binary search when the item is found.
I implemented the algorithm in python iteratively as a demonstration, but it can be implemented in any other language like c, c# or java and can be implemented recursively.

[@owenthomson9778]

If you want to understand the algorithm a bit better, you can try implementing it recursively. I implemented it iteratively as i thought it was clearer.

[@stackootb9822]

Great video bro

[@Mis_guidedz]

Right should be Len -1

[@CODE7X]

Yes

[@ridazouga4144]

In while loop condition should be left

[@paultvshow]

How is 10 is less than 9?

[@shahidgaming3115]

How to show list are dividing into parts in gui form ? 🥲