Sorting Algorithms: Merge Sort and Quick Sort

Merge sort is the skibidi technique for sorting with that dank divide and conquer vibe. You break it down, conquer the tiny goons, and merge them back into a sigma sorted array. Time complexity is O(n log n), so it is lowkey efficient but needs extra space. Quick sort, on the other hand, is the edge master of in-place sorting. You choose a pivot, partition like a boss, and recursively get those values in check. Avg time complexity is also O(n log n), but beware of the O(n²) in the worst case. These algorithms are the ship of the sorting world.