Which of the following describes comparison-based sorting algorithms?

Comparison-based sorting algorithms are defined by their reliance on comparing elements to determine their order. These algorithms work by examining pairs of elements from the dataset and determining their relative positions, which guides the overall sorting process. Common examples include algorithms like Quick Sort, Merge Sort, and Bubble Sort.

In the context of the options provided, the correct choice focuses on the fundamental mechanism of these algorithms—utilizing comparisons between elements. This process can involve comparing two elements directly and making decisions based on which is smaller, larger, or equal, effectively forming the basis for sorting.

On the other hand, other options describe different types of sorting techniques. Some algorithms might sort without comparisons, such as Counting Sort or Radix Sort, which rely on the frequency of elements rather than direct comparisons. Others, like certain randomized algorithms, introduce randomness as part of their approach but do not fundamentally rely on comparison-based logic. Therefore, the definition of comparison-based sorting specifically aligns with the practice of comparing elements, making it the accurate choice.