one-iteration sorting
[wʌn ɪˈtəreɪʃən ˈsɔːrtɪŋ]
nounpl: one-iteration sortings
ordenação em uma única iteração
1. A sorting algorithm or process that requires only a single pass through the data to arrange elements in a desired order, typically applied to counting sort or radix sort algorithms
One-iteration sorting is efficient for sorting integers within a known range.
A ordenação em uma única iteração é eficiente para ordenar inteiros dentro de um intervalo conhecido.
2. In computer science, a sorting technique that completes in linear time by processing all elements once rather than through repeated comparisons
The radix sort is an example of one-iteration sorting that avoids comparison-based operations.
O radix sort é um exemplo de ordenação em uma única iteração que evita operações baseadas em comparação.
This term is primarily used in academic and professional computing contexts in both Brazil and the USA. It represents modern algorithmic thinking emphasizing computational efficiency. In Brazilian universities and tech companies, understanding one-iteration sorting is considered fundamental to computer science education, particularly in algorithms and data structures courses.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →