Heapsort

Table of Contents:

Helpful Resources & Intro (skip this) 0:00 - 1:39
Heap Sort Overview 1:39 - 3:32
Establishing Our Mapping System 3:32 - 9:03
Walking Though The "Build Heap" Phase 9:03 - 14:29
"Build Heap" Phase Finished 14:29 - 15:59
"Extraction" Phase Overview 15:59 - 16:58
Walking Though The "Extraction" Phase 16:58 - 24:12
Analyzing "Build Heap's" Runtime 24:12 - 26:21
There Is A Problem... 26:21 - 28:16
Diving Into Analyzing "Build Heap" In Detail 28:16 - 35:03
Analyzing The "Extraction" Phase's Runtime 35:03 - 38:53
This Is Why Heap Sort Is Θ(n * log(n)) 38:53 - 39:23
Camera Dies 39:23
Pre-Recorded Wrap-Up 39:23 - 39:58

Implementing A Binary Heap: https://github.com/bephrem1/backtobackswe/blob/master/Sorting%2C%20Searching%2C%20%26%20Heaps/ImplementABinaryHeap/ImplementABinaryHeap.java
GeeksForGeeks: https://www.geeksforgeeks.org/heap-sort/

Discussion

0 comments