Assertion: algorithm's time | /r/HasProperty | log n
Facets:
Source sentences:
text: Of the algorithms described here, this is the first that scales well to very large lists, because its worst-case running time is O(n log n).