Let's take a look at one binary search example to better understand its working. Consider a sorted array: [2, 4, 6, 8, 10, 12, 14], and our objective is to locate the number 10.

Twenty Questions is Too Many That’s why binary search is one of my favorite things. It’s a tool-slash-algorithm that I use multiple times per day, and it’s what underlies ADCs.

What’s fantastic about binary search is how little it demands of you. Unlike fancier optimization methods, you don’t need any derivatives.