Binary Search

Binary search is a divide and conquer algorithm that finds items in a sorted array very quickly!

Instead of checking every item one by one, we eliminate half of the remaining items with each comparison!

📊 For 1,000,000 items: Linear needs up to 1,000,000 comparisons, Binary needs only 20 !