For example, searches, approximate matches, and the operations available to sorted arrays can be performed more efficiently than binary search on specialized data structures such as van Emde Boas trees, fusion trees, tries, and bit arrays.
Searches, approximate matches, and operations on sorted arrays can be more efficient than binary search when applied to specialized data structures like van Emde Boas trees, fusion trees, tries, and bit arrays.