Assertion: sorting algorithm | /r/CapableOf | use big o notation
Facets:
value: as the length of the list
type: OTHER
value: with n
type: OTHER
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.