non-randomized algorithm
[nɑn-ˈran-də-ˌmīzd ˈal-gə-ˌri-t͟həm]
nounpl: non-randomized algorithms
algoritmo não-aleatório
1. A computational algorithm that produces the same output for a given input every time it is executed, without incorporating random choices or probabilistic elements in its decision-making process.
The quicksort algorithm with a fixed pivot selection is a non-randomized algorithm that always follows the same execution path for identical inputs.
O algoritmo de ordenação com seleção de pivô fixa é um algoritmo não-aleatório que sempre segue o mesmo caminho de execução para entradas idênticas.
2. In computational complexity theory, an algorithm whose behavior is entirely deterministic and does not depend on random number generation or probabilistic choices.
Non-randomized algorithms are easier to analyze theoretically but may have worse average-case performance than randomized variants.
Algoritmos não-aleatórios são mais fáceis de analisar teoricamente, mas podem ter desempenho em caso médio pior do que variantes aleatórias.
This is a technical term primarily used in computer science and mathematics education. Both Brazil and Portugal use similar terminology, with Brazilian Portuguese favoring 'não-aleatório' while Portugal may use 'não-aleatorizado'. The term reflects the global standardization of computer science vocabulary.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →