Sequential and binary search

Given a sorted array and a key, find an index of the key, or report that the key is not in the array.

Find a key in a sorted array. Compare the key with the middle item, and keep only the half that can hold the key.