Which of the following is a common sorting algorithm?

Quick Sort is a widely recognized and commonly used sorting algorithm. Its efficiency stems from its divide-and-conquer approach, which breaks down the larger problem of sorting into smaller subproblems. Here's how it works: it selects a 'pivot' element from the array and partitions the other elements into two subarrays, according to whether they are less than or greater than the pivot. This process is recursively applied to the subarrays, leading to a highly efficient sorting process.

The average-case time complexity of Quick Sort is O(n log n), making it significantly faster than simpler algorithms like Bubble Sort and Insertion Sort, especially for larger datasets. Additionally, Quick Sort has good performance in practice, despite its worst-case time complexity of O(n²), which can arise in specific scenarios such as when the smallest or largest element is consistently chosen as the pivot.

In comparison, while Merge Sort is another efficient sorting algorithm with a time complexity of O(n log n), it operates differently and requires additional space for the merging process. Bubble Sort, on the other hand, is more intuitive but much less efficient, with a time complexity of O(n²). Insertion Sort is also simple and has a time complexity of O(n²) in the average and worst case,