invariant algorithm
[ɪnˈvɛriənt ˈælɡərɪðəm]
nounpl: invariant algorithms
algoritmo invariante
1. An algorithm that maintains certain properties or characteristics that remain unchanged throughout its execution, regardless of input variations within a defined scope
The sorting algorithm uses loop invariants to ensure that the partially sorted array maintains its invariant property at each iteration.
O algoritmo de ordenação utiliza invariantes de loop para garantir que o array parcialmente ordenado mantenha sua propriedade invariante em cada iteração.
2. In computer science, an algorithm whose correctness can be proven by demonstrating that certain conditions (invariants) remain true before, during, and after execution
An invariant algorithm for binary search maintains the invariant that the target element, if it exists, must be within the current search range.
Um algoritmo invariante para busca binária mantém o invariante de que o elemento alvo, se existir, deve estar dentro do intervalo de busca atual.
This is a technical term primarily used in academic and professional computer science contexts. It is essential in formal verification and algorithm design courses. Both English and Portuguese-speaking computer scientists use these terms with identical meanings, making it part of the universal language of computational theory.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →