Sorting with Heap Sort | Sorting Algorithms Visualized

Heap Sort description: Heap Sort maintains a tree (or "heap") as an unsorted array and an additional sorted array. Every iteration the heap sort moves the tallest element into the sorted array, and then it maintains the heap.Heap Sort example: You are managing a recruitment team for a big company. Each bottom-level employees receives a batch of applications that will be organized by skill. Middle-level receives a few applications from bottom-level, they organize them by skill. The top-level selects from applications the middle-level gave them.