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()}
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()}
本文标题:[Swift Algorithm] Heap sort
本文链接:https://www.haomeiwen.com/subject/hysujttx.html
网友评论