Assertion: search algorithm | /r/ObjectUse | used for table lookups
Facets:
value: on arrays
type: LOCATION
value: on sorted lists
type: LOCATION
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.