Talk:Merge Sort

From Second Life Wiki
Revision as of 15:29, 18 October 2012 by Project Neox (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.