How is binary search vs other searching schemes?

Sorted arrays with the binary search are a very inefficient solution when insertion and deletion operations are interleaved with retrieval. In addition, sorted arrays can complicate memory use especially when elements are often inserted into the array.
Binary search is faster than linear search for sorted arrays except if the array is short, although the array needs to be sorted beforehand.
Binary search is usually more efficient for searching as binary search trees will most likely be imperfectly balanced, resulting in slightly worse performance than binary search.
a data structure that maps keys to records using a hash function, is generally faster than binary search on a sorted array of records.