1. An algorithm that determines the order or properties of data primarily through comparisons between elements, such as sorting algorithms that use comparison operations like less than or greater than.
Quicksort is a comparison-based algorithm commonly used for sorting arrays.
Quicksort é um algoritmo baseado em comparação comumente usado para ordenar arrays.
2. An algorithmic approach where the fundamental operation involves comparing two or more data elements to make decisions about processing or arrangement.
Comparison-based algorithms have a theoretical lower bound of O(n log n) for sorting n elements.
Algoritmos baseados em comparação têm um limite inferior teórico de O(n log n) para ordenar n elementos.