Sorting algorithms/Heapsort: Difference between revisions

Content added Content deleted
Line 3,008: Line 3,008:
toList (Node x l r) = x : toList (merge l r)
toList (Node x l r) = x : toList (merge l r)


mergeSort :: Ord a => [a] -> [a]
heapSort :: Ord a => [a] -> [a]
mergeSort = toList . fromList</syntaxhighlight>
heapSort = toList . fromList</syntaxhighlight>


e.g
e.g