Which sorting algorithm is considered a comparison-based sort?

Answer:

Explanation:

Quick Sort is a comparison-based sorting algorithm, meaning it sorts elements by comparing them to one another. The efficiency of Quick Sort is based on how well the pivot element is chosen and how the partitioning step divides the list.

In contrast, non-comparison-based algorithms like Radix Sort and Counting Sort use other properties of the elements (such as their digit values or frequencies) rather than comparisons to sort them.

Comparison-based algorithms have a lower bound of O(n log n) for time complexity, which applies to sorting algorithms like Quick Sort, Merge Sort, and Heap Sort.