non-comparison sort
[/nɑn kəmˈpærɪsən sɔrt/]
nounpl: non-comparison sorts
ordenação não-comparativa
1. A sorting algorithm that does not rely on comparing elements to determine their order, instead using other properties like digit values, distribution, or radix to organize data
Counting sort and radix sort are examples of non-comparison sort algorithms that can achieve linear time complexity.
A ordenação por contagem e a ordenação por raiz são exemplos de algoritmos de ordenação não-comparativa que podem alcançar complexidade de tempo linear.
2. In computer science, a category of sorting methods that avoid pairwise element comparisons, making them efficient for specific data types
Non-comparison sorts are particularly useful when sorting integers within a limited range.
As ordenações não-comparativas são particularmente úteis ao ordenar inteiros dentro de um intervalo limitado.
This is a specialized technical term primarily used in computer science, software engineering, and academic settings in both Brazil and the United States. It has no colloquial usage outside technical contexts. In Brazil, the term is increasingly used in computer science curricula and tech industry documentation, often imported directly from English as 'non-comparison sort' or translated as 'ordenação não-comparativa'.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →