Talk:Sorting algorithms/Merge sort: Difference between revisions

Talk:Sorting algorithms/Merge sort (view source)

158 bytes added , 6 years ago

Anonymous user

Revision as of 22:40, 11 December 2017 (view source) rosettacode>Stevenvar (→‎Haskell "simple" implementation is Quicksort: new section) ← Older edit		Latest revision as of 02:34, 14 December 2017 (view source) rosettacode>Vektorweg (→‎Haskell "simple" implementation is Quicksort)
(One intermediate revision by one other user not shown)
Line 25: == 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~~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) ... Sorry, I totally missed the point when I wrote that. Reverted. --[[User:Vektorweg\|Vektorweg]] ([[User talk:Vektorweg\|talk]]) 02:34, 14 December 2017 (UTC)