[Swift Algorithm] Heap sort

public func heapsort<T>(a: [T], _ sort: (T, T) -> Bool) -> [T] { 

let reverseOrder = { i1, i2 in sort(i2, i1) } 

var h = Heap(array: a, sort: reverseOrder) 

return h.sort()}