Assertion: algorithm's operation | /r/HasProperty | done on sorted array
Facets:
value: efficiently
type: MANNER
value: always
type: DEGREE
value: regardless of the keys
type: OTHER
Source sentences:
text: As long as the keys can be ordered, these operations can always be done at least efficiently on a sorted array regardless of the keys.
text: Some operations, like finding the smallest and largest element, can be done efficiently on sorted arrays but not on hash tables.