quicksort英 [k'wɪksɔ:t] 美 [k'wɪksɔt]
释义快速排序;
英英释义
Quicksort
- Quicksort, or partition-exchange sort, is a sorting algorithm developed by Tony Hoare that, on average, makes O(n log n) comparisons to sort n items. In the worst case, it makes O(n2) comparisons, though this behavior is rare.
以上来源于:Wikipedia
权威例句
QuicksortQuicksortQuicksortInstitut f ur Algebra und Diskrete MathematikProgramming Assignment 1 - Step 3All software used at own risk - authors take no responsibility!from Recursion to Iteration 1Editors ImplementingIndex of /~fiii/materiale_esercitazioni/AA 2009-10/Esercitazione_9Index of /~fiii/materiale_esercitazioni/AA 2011-12/esercitazione-2011-11-25-sortingImplementing Quicksort Programs.Algorithm 64: QuicksortA Practical Quicksort Algorithm for Graphics Processors