Comparison Sorting Algorithms Complexity

From NovaOrdis Knowledge Base
Revision as of 00:37, 10 August 2018 by Ovidiu (talk | contribs) (→‎Overview)
Jump to navigation Jump to search

Internal

Overview

TODO: comparison sorting cannot perform better than n lg n. The worst-case running time of a comparison algorithm is Ω(n lgn)