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

    学习怎么用

    权威例句

    Quicksort
    Quicksort
    Quicksort
    Institut f ur Algebra und Diskrete Mathematik
    Programming Assignment 1 - Step 3
    All software used at own risk - authors take no responsibility!
    from Recursion to Iteration 1
    Editors Implementing
    Index of /~fiii/materiale_esercitazioni/AA 2009-10/Esercitazione_9
    Index of /~fiii/materiale_esercitazioni/AA 2011-12/esercitazione-2011-11-25-sorting
    Implementing Quicksort Programs.
    Algorithm 64: Quicksort
    A Practical Quicksort Algorithm for Graphics Processors