non-comparison sorting algorithm
[nɑn-kəmˈpærɪsən ˈsɔrtɪŋ ˈælɡərɪðəm]
nounpl: non-comparison sorting algorithms
algoritmo de ordenação sem comparação
1. A sorting algorithm that orders elements without directly comparing them to each other, instead using properties of the elements or their values to determine their order
Counting sort is a non-comparison sorting algorithm that works efficiently for integers within a known range.
Ordenação por contagem é um algoritmo de ordenação sem comparação que funciona eficientemente para inteiros dentro de um intervalo conhecido.
2. An algorithm that achieves sorting by exploiting the structure of the input data rather than by making pairwise comparisons
Radix sort, another non-comparison sorting algorithm, sorts numbers digit by digit.
Ordenação por raiz, outro algoritmo de ordenação sem comparação, ordena números dígito por dígito.
This is primarily a technical term used in computer science and software engineering education. It appears frequently in algorithm courses, computer science textbooks, and technical interviews. The concept is important in computational theory as it demonstrates that sorting can be achieved in linear time under certain conditions, contrasting with the O(n log n) lower bound for comparison-based sorting. Both Brazilian and Portuguese technical communities use identical terminology.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →