Talk:Sorting algorithms/Merge sort: Difference between revisions

Content added Content deleted

Inline

Revision as of 22:40, 11 December 2017 (view source) rosettacode>Stevenvar (→‎Haskell "simple" implementation is Quicksort: new section) ← Older edit		Revision as of 22:41, 11 December 2017 (view source) rosettacode>Stevenvar (→‎Haskell "simple" implementation is Quicksort) Newer edit →
Line 25:		Line 25:
	== Haskell "simple" implementation is Quicksort ==		== Haskell "simple" implementation is Quicksort ==

	Except I'm mistaken the given Haskell simple implementation is actually a Quicksort algorithm : there is no concept of "merging" lists, and the ~~originallist~~ isn't split but instead filtered between values inferior and values greater than the head of the original list (i.e. something akin to the quicksort pivot) ...		Except I'm mistaken the given Haskell simple implementation is actually a Quicksort algorithm : there is no concept of "merging" lists, and the original list isn't split but instead filtered between values inferior and values greater than the head of the original list (i.e. something akin to the quicksort pivot) ...