What is a common feature among comparison-based sorting algorithms?

In comparison-based sorting algorithms, a fundamental mechanism is the use of comparisons between elements to establish their order. These algorithms work by comparing pairs of elements and reordering them based on the results of those comparisons. For example, if one element is greater than another, it can be positioned accordingly to achieve a sorted arrangement. This reliance on comparison is what distinguishes these algorithms, such as quicksort, mergesort, and bubblesort, from non-comparison-based sorting algorithms like radix sort or counting sort, which utilize different methods for sorting.

The other options do not accurately reflect the essential nature of comparison-based sorting algorithms. Some sorting algorithms can work on sorted lists, and not all comparison-based ones have to sort non-numeric data exclusively; they can handle various data types as long as a comparison operation is defined. Therefore, the reliance on comparing elements is what characterizes comparison-based sorting algorithms clearly and accurately.