Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
Updated first D entry
(Nimrod -> Nim) |
(Updated first D entry) |
||
Line 604:
<lang d>import std.stdio, std.container;
void heapSort(T)(T[] data) /*pure nothrow @safe @nogc*/ {
for (auto h = data.heapify; !h.empty; h.removeFront) {}
}
| |||