Comparison sort is a category of sorting algorithms that operate by comparing elements to one another to determine their order. This method relies on comparing pairs of elements and deciding their relative positions based on these comparisons. The most common characteristic of comparison sorts is that they can be implemented so that the sorted order depends solely on the way elements are compared.
New to topics? Read the docs here!