 Binary search is ideal for such matches, performing them in logarithmic time.Binary search also supports approximate matches.Some operations, like finding the smallest and largest element, can be done efficiently on sorted arrays but not on hash tables.