Binary Search is one of the most efficient algorithms for finding the position of an element in a sorted array. In just 100 seconds, learn how it works, why it’s so fast, and how you’ve ...

The final case isn’t part of the algorithm, but it’s for shifting our data back up the chain when we want to retrieve our array of sorted elements. Perfect!