quicksort

基本解釋

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

同根派生

• quicksort相關(guān)詞

英漢例句

• It isn't true that QuickSort is the fastest Algorithm available.This is only true for pure Integer or Word arrays.
  快速排序并不真是最快的排序算法，它只對純整形或字數(shù)組有效。
• QuickSort implementation in CSharp complete source code can be directly used by the test.
  (譯)：QuickSort執(zhí)行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.
  比如成績單,一開始可能是按人員的學號順序排好了的,現(xiàn)在讓我們用成績排,那么你應(yīng)該保證,本來張三在李四前面,即使他們成績相同,張三不能跑到李四的后面去。
• Quicksort integer array by Raymond Gardner
  整數(shù)數(shù)組的快速排序

• quicksort更多例句