 Binary search can be used to perform exact matching and set membership (determining whether a target value is in a collection of values).There are data structures that support faster exact matching and set membership.However, unlike many other searching schemes, binary search can be used for efficient approximate matching, usually performing such matches in formula_150 time regardless of the type or structure of the values themselves.