ordenação rápida
1. A highly efficient divide-and-conquer sorting algorithm that partitions an array around a pivot element and recursively sorts the sub-arrays
Quick sort is one of the most widely used sorting algorithms in computer science due to its average-case time complexity of O(n log n).
A ordenação rápida é um dos algoritmos de ordenação mais amplamente utilizados em ciência da computação devido à sua complexidade de tempo média de O(n log n).
2. A sorting method developed by C.A.R. Hoare in 1960 that selects a pivot and partitions data into smaller and larger elements
The quick sort algorithm works efficiently on most datasets, though it can degrade to O(n²) in worst-case scenarios.
O algoritmo de ordenação rápida funciona eficientemente na maioria dos conjuntos de dados, embora possa degradar para O(n²) em cenários de pior caso.
Quick sort is fundamental to computer science curricula in both Brazil and the USA. In Brazilian tech companies, the English term 'quicksort' is commonly used alongside or instead of 'ordenação rápida'. The algorithm is named after its inventor C.A.R. Hoare and is considered a cornerstone algorithm in teaching data structures and algorithms globally.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →