heapSort

Heap sort. Unstable, O(N log N) time average and worst case, O(1) space, large constant term in time complexity.

T[0]

heapSort

(

alias compFun = "a < b"

T...

)

(

)

if (

T.length != 0

)

in { assert (data.length > 0); size_t len = data[0].length; foreach (array; data[1 .. $]) { assert (array.length == len); } }

Meta