The OpenD Programming Language

heapSort

dstats sort

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...
)
(
T data
)
if (
T.length != 0
)

Meta

Source

See Implementation

dstats sort functionsstructs
Page generated by adrdox