Assertion: sorting algorithm | /r/CapableOf | utilize quicksort
Facets:
Source sentences:
text: For example, many sorting algorithms which utilize randomness, such as Quicksort, have a worst-case running time of O(n2), but an average-case running time of O(nlog(n)), where n is the length of the input to be sorted.