Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
→{{header|Standard ML}}
(Add {{Standard ML solution}}) |
|||
Line 2,616:
open IntHeap
fun heapsort' Empty = []
| heapsort' h = findMin h :: (heapsort' o deleteMin) h;▼
in
val test_0 = heapsort [] = []
val test_1 = heapsort [1,2,3] = [1, 2, 3]
| |||