Name		Name	Last commit message	Last commit date
parent directory ..
README.md		README.md
heapSort.py		heapSort.py

README.md

Lecture 04.

Heaps and Heap Sort

Heap Sort

Time Complexity: 𝛩(nlogn)
Space Complexity: 𝛩(1)

Max Heapify

Time Complexity: 𝛩(n) (not 𝛩(nlogn))
- As level goes up, # of nodes cut in half
- as level L goes up, it takes log(L) times to heapify
Space Complexity: 𝛩(1)