quicksort
导读：quicksort读音音标
英 [k\'wɪksɔ:t]美 [k\'wɪksɔt]
quicksort意思解释
释义快速排序； 英英释义 QuicksortQuicksort, or partition-exchange sort, is a sorting algorit
英 [k\'wɪksɔ:t]美 [k\'wɪksɔt]
quicksort意思解释
释义快速排序； 英英释义 QuicksortQuicksort, or partition-exchange sort, is a sorting algorit
quicksort读音音标
英 [k\'wɪksɔ:t]
美 [k\'wɪksɔt]
quicksort意思解释
释义
快速排序；
英英释义
QuicksortQuicksort, 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.
