adaptive sorting
[ə-ˈdap-tiv ˈsȯr-tiŋ]
nounpl: adaptive sortings
ordenação adaptativa
1. A sorting algorithm that takes advantage of existing order in the input data, performing better when the data is partially sorted or nearly sorted
Adaptive sorting algorithms like Timsort are efficient for real-world data that often contains existing patterns.
Algoritmos de ordenação adaptativa, como o Timsort, são eficientes para dados do mundo real que frequentemente contêm padrões existentes.
2. A computational technique that adjusts its behavior based on the characteristics of the input sequence, such as the degree of pre-existing order
The adaptive sorting approach reduces the number of comparisons needed when processing nearly sorted arrays.
A abordagem de ordenação adaptativa reduz o número de comparações necessárias ao processar arrays quase ordenados.
This is a specialized technical term primarily used in computer science and software engineering contexts. It gained significant prominence after Python's adoption of Timsort as its default sorting algorithm in 2002. The term reflects modern programming practices that emphasize efficiency and practical performance over theoretical elegance. Both English and Portuguese-speaking technical communities use this terminology consistently in academic and professional settings.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →