Talk:Merge Sort: Difference between revisions

Revision as of 16:28, 18 October 2012 view source Project Neox (talk \| contribs) 86 edits 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…"		Revision as of 16:28, 18 October 2012 view source Project Neox (talk \| contribs) 86 edits Blanked the page Newer edit →
Line 1:		Line 1:
	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.

Revision as of 16:28, 18 October 2012