01
Foundations
·
Priority Structure
Heap Sort
⏱
O(n log n)
◧
O(1)
4
10
3
5
1
15
2
0
1
2
3
4
5
6
State vector
[
4
,
10
,
3
,
5
,
1
,
15
,
2
]
Step
1
/ 38
Speed
0.5×
1×
2×
4×
Speed
0.5×
1×
2×
4×