1. A sorting algorithm that determines the order of elements by comparing pairs of elements using a comparison operator (such as less than, greater than, or equal to)
Quicksort and mergesort are examples of comparison sort algorithms.
Quicksort e mergesort são exemplos de algoritmos de ordenação por comparação.
2. In computer science, any sorting method where the relative order of elements is determined solely by comparing them
The efficiency of a comparison sort is limited by the lower bound of O(n log n) in the average case.
A eficiência de uma ordenação por comparação é limitada pelo limite inferior de O(n log n) no caso médio.