Introduction to algorithms Notes--67th chapter heap Sorting and quick sorting

Sixth chapter Heap Sorting

Minimum heap and maximum heap: approximate complete binary tree

A[parent (i)]<=a[i] or a[parent (i)]>=a[i]

Build heap complexity O (n)

Sort O (NLGN)

In practical applications, fast sorting is generally better than heap sorting. Can be used for priority queues and so on.

In a heap containing n elements, all priority queue operations can be done in O (LGN) time.

Seventh Chapter Quick Sort

Divide and conquer the same sort of thoughts as merge sorts

Primary pivot can be randomly generated

Introduction to algorithms Notes--67th chapter heap Sorting and quick sorting