Talk:Merge Sort
Jump to navigation
Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
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.