Comparison Sorting Algorithms Complexity

From NovaOrdis Knowledge Base

Revision as of 00:36, 10 August 2018 by Ovidiu (talk | contribs) (→‎Overview)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Internal

Sorting Algorithms

Overview

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

Retrieved from "https://kb.novaordis.com/index.php?title=Comparison_Sorting_Algorithms_Complexity&oldid=47823"