Binary Search

In a Nutshell Given a sorted array, we need to find the position of a target value. We start by comparing the target to the middle value and if they are not equal we can eliminate one half of the array where the target value cannot lie since this is ...