non-comparison-based algorithm
[/nɒn kəmˈpærɪsən beɪst ˈælɡərɪðəm/]
nounpl: non-comparison-based algorithms
algoritmo não baseado em comparação
1. A computational algorithm that sorts or processes data without using comparison operations (such as < or >) between elements
Counting sort is a non-comparison-based algorithm that achieves linear time complexity for sorting integers within a specific range.
Counting sort é um algoritmo não baseado em comparação que alcança complexidade de tempo linear para ordenar inteiros dentro de um intervalo específico.
2. An algorithm that determines order or relationships by methods such as hashing, counting, or radix operations rather than direct element comparison
Radix sort is another non-comparison-based algorithm commonly used for sorting large datasets of numbers.
Radix sort é outro algoritmo não baseado em comparação comumente usado para ordenar grandes conjuntos de dados numéricos.
This is specialized technical terminology used in computer science, software engineering, and mathematics education in both Brazil and Portugal. The term is used identically in both Portuguese-speaking regions and is particularly important in algorithm courses and competitive programming contexts. There is no colloquial or slang equivalent as it is domain-specific jargon.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →