quicksort

基本解释

• n.快速排序
• 快速分类.

同根派生

英汉例句

• It isn't true that QuickSort is the fastest Algorithm available.This is only true for pure Integer or Word arrays.
  快速排序并不真是最快的排序算法，它只对纯整形或字数组有效。
• QuickSort implementation in CSharp complete source code can be directly used by the test.
  (译)：QuickSort执行CSharp完整的源代码可以直接使用的考验。
• The concept of in-place quicksort binary tree has great theoretical and practical reference value to the research and improvement of sorting algorithm.
  原地快速排序二叉树的概念对排序算法的研究和改进具有很好的理论和实用参考价值。
• Empirical tests showed it to be as fast as a highly optimized quicksort.A quicksort is generally considered to be faster than a merge sort but isn't stable and doesn't guarantee n log(n) performance.
  比如成绩单,一开始可能是按人员的学号顺序排好了的,现在让我们用成绩排,那么你应该保证,本来张三在李四前面,即使他们成绩相同,张三不能跑到李四的后面去。
• Quicksort integer array by Raymond Gardner
  整数数组的快速排序