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.
Compared to binary search, searches, approximate matches, and operations on sorted arrays are faster when performed on specialized data structures such as van Emde Boas trees, fusion trees, tries, and bit arrays.