Comparison Sorting Algorithms Complexity: Difference between revisions
Jump to navigation
Jump to search
| Line 5: | Line 5: | ||
=Overview= | =Overview= | ||
<font color=darkgray>TODO: comparison sorting cannot perform better than n lg n. The worst-case running time of a comparison algorithm is Ω(n lgn)</font> | <font color=darkgray>TODO: comparison sorting cannot perform better than n lg n. The worst-case running time of a comparison algorithm is Ω(n lgn). | ||
[[CLRS]] page 193. | |||
</font> | |||
Revision as of 01:15, 10 August 2018
Internal
Overview
TODO: comparison sorting cannot perform better than n lg n. The worst-case running time of a comparison algorithm is Ω(n lgn).
CLRS page 193.