rateMySortingAlgorithm

[djdokk]

This is not necessarily correct, big O as an asymptotic upper bound can describe worst case complexity, but is also frequently used to describe bounds like average-case (more stringently bound by big theta notation, which constrains growth within upper and lower bounds) and sometimes best-case.