Algorithms

Heap Sort Heap sort works by using the heap datastructure. This sorting algorithm has a performance of $O(n*log(n))$ which makes it fast. How Heapsort works by first creating the heap datastructure, so let's say we have an array, it will then convert this array into