Sorting Algorithms.
algorithms, meaning they require only a constant amount of extra memory. Merge Sort, Quick Sort, and Heap Sort are not in place, and they require additional memory for recursive calls or heap data structures. The space complexity for these algorithms is O(n) or O(log n), depending on the specific