[ENHANCEMENT] Add Heap Sort to Sorts Module

[brandoniscoding-dev]

• The current Sorts module lacks the heap sort algorithm, which is an efficient, in-place sorting algorithm with O(n log n) time complexity. This could be useful in situations where space is a concern but we still need a reliable sorting method.

• Implement heap sort within the Sorts module. This will involve building a max heap or min heap and then extracting elements in order to place them into their correct position in the sorted array.

• Alternatives like merge sort and quicksort are already included, but heap sort could provide a valuable in-place sorting option with consistent time complexity.

• The heap sort implementation should be written in a way that is consistent with the current sorting functions in the module, ensuring readability and coherence.