recursive sort
[rɪˈkɜːrsɪv sɔːrt]
nounpl: recursive sorts
ordenação recursiva
1. A sorting algorithm that uses recursion to divide a dataset into smaller subsets, sort them, and then combine them back together in sorted order
Quicksort is a popular recursive sort algorithm that divides the array around a pivot element.
Quicksort é um algoritmo de ordenação recursiva popular que divide o array em torno de um elemento pivô.
2. Any sorting method that solves the problem by recursively breaking it down into smaller instances of the same problem
The recursive sort function calls itself on smaller portions of the unsorted list until the base case is reached.
A função de ordenação recursiva chama a si mesma em porções menores da lista não ordenada até que o caso base seja atingido.
This is a technical term used universally in computer science and programming education across both Brazil and the United States. It is particularly important in computer science curricula and is discussed extensively in algorithms courses. The term has no cultural variation and maintains the same technical meaning across all English and Portuguese-speaking regions.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →