comparison-based sorting algorithm
[/kəmˈpærɪsən beɪst ˈsɔːrtɪŋ ˈælɡərɪðəm/]
nounpl: comparison-based sorting algorithms
algoritmo de ordenação baseado em comparação
1. A sorting algorithm that determines the order of elements by comparing pairs of elements and using the results of these comparisons to guide the sorting process.
Quicksort is a comparison-based sorting algorithm that uses a pivot element to partition the data.
Quicksort é um algoritmo de ordenação baseado em comparação que usa um elemento pivô para particionar os dados.
2. Any algorithm that sorts data exclusively through pairwise element comparisons, with a theoretical lower bound of O(n log n) for worst-case time complexity.
Merge sort and heap sort are both comparison-based sorting algorithms.
Merge sort e heap sort são ambos algoritmos de ordenação baseados em comparação.
This is a technical term used primarily in computer science and software engineering education and industry in both Brazil and the USA. It has no colloquial equivalent and is used consistently across both English and Portuguese-speaking technical communities. The term is essential in algorithm design courses and technical interviews.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →