Anonymous user
Talk:Sorting algorithms/Merge sort: Difference between revisions
Talk:Sorting algorithms/Merge sort (view source)
Revision as of 02:34, 14 December 2017
, 6 years ago→Haskell "simple" implementation is Quicksort
Line 26:
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) ...
Sorry, I totally missed the point when I wrote that. Reverted. --[[User:Vektorweg|Vektorweg]] ([[User talk:Vektorweg|talk]]) 02:34, 14 December 2017 (UTC)
| |||