Heap（堆） Operation Binary Fibonacci Strict Fibonacci find-min O(1) O(1) O(1) delete-min O(log n) O(log n) O(1) insert O(log n) O(1) O(1) decrease-key O(log n) O(1) O(1) merge O(n) O(1) O(1) Min Heap（小顶堆） Max Heap（大顶堆） Note: 快排的效率是最好的