Assertion: search algorithm | /r/CapableOf | outperform sequential search
Facets:
Source sentences:
text: For example, a binary search algorithm (with cost O(log n) ) outperforms a sequential search (cost O(n) ) when used for table lookups on sorted lists or arrays.