comparison algorithm
[/kəmˈpærɪsən ˈælɡərɪðəm/]
nounpl: comparison algorithms
algoritmo de comparação
1. A computational procedure that systematically examines and contrasts two or more data elements to determine their relationship, equality, or order
The sorting algorithm uses a comparison algorithm to arrange numbers in ascending order.
O algoritmo de ordenação utiliza um algoritmo de comparação para organizar números em ordem crescente.
2. In computer science, a method that counts the number of comparisons needed to sort or search data as a measure of algorithmic efficiency
The comparison algorithm model helps analyze the time complexity of sorting operations.
O modelo de algoritmo de comparação ajuda a analisar a complexidade de tempo das operações de ordenação.
3. A specific category of algorithms limited to operations that compare elements pairwise rather than using other computational methods
QuickSort is a comparison algorithm that partitions data based on element comparisons.
QuickSort é um algoritmo de comparação que particiona dados baseado em comparações de elementos.
This is technical terminology primarily used in computer science, software engineering, and mathematics education. It is universally understood in Brazilian and Portuguese tech communities without regional variation. The term appears frequently in university curricula, technical documentation, and professional development discussions across both Brazil and Portugal.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →