comparison sorting algorithm
[/kəmˈpærɪsən ˈsɔːrtɪŋ ˈælɡərɪðəm/]
nounpl: comparison sorting algorithms
algoritmo de ordenação por comparação
1. A sorting algorithm that orders elements by comparing pairs of elements to determine their relative order
Quicksort is a popular comparison sorting algorithm used in many programming languages.
Quicksort é um algoritmo de ordenação por comparação popular usado em muitas linguagens de programação.
2. Any algorithm that sorts data by making pairwise comparisons between elements, with a theoretical lower bound of O(n log n) comparisons
The comparison sorting algorithm has a minimum time complexity of O(n log n) in the average case.
O algoritmo de ordenação por comparação tem uma complexidade de tempo mínima de O(n log n) no caso médio.
This is a technical term widely used in computer science education, particularly in algorithms courses. It appears frequently in academic literature and technical documentation in both English-speaking countries and Brazil. The term is part of standardized computer science vocabulary taught in universities worldwide.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →