polynomial sorting
[/ˌpɒlɪˈnoʊmiəl ˈsɔːrtɪŋ/]
nounpl: polynomial sortings
ordenação polinomial
1. A sorting algorithm or method whose time complexity can be expressed as a polynomial function of the input size n, such as O(n²), O(n³), or O(n log n)
Bubble sort is a polynomial sorting algorithm with O(n²) time complexity.
O algoritmo de ordenação por bolha é uma ordenação polinomial com complexidade de tempo O(n²).
2. In computer science, any sorting technique whose computational requirements grow polynomially rather than exponentially or factorial with respect to the number of elements
Most practical polynomial sorting algorithms are more efficient than brute force exponential methods.
A maioria dos algoritmos de ordenação polinomial práticos são mais eficientes do que métodos exponenciais de força bruta.
This is a specialized technical term primarily used in computer science, mathematics, and software engineering fields in both Brazil and the United States. It is rarely used in casual conversation and is specific to academic and professional technical contexts. The term gained prominence with the development of complexity theory and the P vs NP problem in computer science.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →