Assertion: algorithm's time | /r/HasProperty | \sim ac_n$
Facets:
Source sentences:
text: To separate the analysis from the implementation, we define $C_N$ to be the number of compares to sort $N$ elements and analyze $C_N$ (hypothesizing that the running time for any implementation will be $\sim aC_N$ for some implementation-dependent constant $a$).