Sorting Algorithms, Sorting, Merge Sort, Quick Sort, Algorithms.
Quick Sort also provides O(n log n) performance on average, although its performance can degrade to O(n²) if the pivot values are not well chosen. However, with good pivot selection strategies, Quick Sort is often faster than Merge Sort in practice and is widely used in many standard library