Difference between revisions of "Talk:Merge Sort"
Jump to navigation
Jump to search
Project Neox (talk | contribs) (Created page with "Uh, my only criticism is that llListSort uses bubble sorting, which in effective, is extremely inefficient when dealing with larger lists. (O(n^2)) While merge sorting is probabl…") |
Project Neox (talk | contribs) |
(One intermediate revision by the same user not shown) | |
(No difference)
|
Latest revision as of 16:29, 18 October 2012
Uh, my only criticism is that llListSort uses bubble sorting, which in effective, is extremely inefficient when dealing with larger lists. (O(n^2)) While merge sorting is probably one of the most efficient methods when sorting larger lists. ((O(n log n)). So, in sum, it comes down to the battle of efficiency v.s. speed. You choose.