Assertion: sorting algorithm | /r/HasAspect | a time requirement of o(n
Facets:
Source sentences:
text: Methods have been developed for the analysis of algorithms to obtain such quantitative answers (estimates); for example, the sorting algorithm above has a time requirement of O(n), using the big O notation with n as the length of the list.