Assertion: algorithm's run time | /r/HasProperty | log n
Facets:
Source sentences:
text: Big O notation is a convenient way to express the worst-case scenario for a given algorithm, although it can also be used to express the average-case — for example, the worst-case scenario for quicksort is O(n2), but the average-case run-time is O(n log n).