Assertion: algorithm's time | /r/CapableOf | see big o notation
Facets:
value: for the notation
type: PURPOSE
Source sentences:
text: In many cases, the n · log n running time is simply the result of performing a Θ(log n) operation n times (for the notation, see Big O notation § Family of Bachmann–Landau notations).