As the name suggests, the Binary Search Algorithm works in a binary fashion, divided into halves so as to reach the desired target. The problem is stated thus: one would want to center their search on the mid element, hoping to see that the search space converges either to a target greater than or a target lesser than the mid element. The one question stays unsolved: will this mid division converge to our target? This step is repeated until the target is either found or the subarray size is equal to zero. The key up to this point is that the array always needs to be sorted in order for the binary search to function.