quick sort的意思

quick sort中文翻譯：

[計]快速分類

相似詞語短語

quick quick───快，快

sort───n.種類；方式；品質；[計]（資料、數據的）分類，排序；vi.分類；協調；交往；vt.將…分類；將…排序；挑選出某物

quick───adv.迅速地；敏捷地；adj.快的，迅速的；敏捷的；靈敏的；n.核心；傷口的嫩肉；（古）活著的人們；（非正式）快投手；n.(Quick)（美、英、加、德、印）奎克（人名）；int.快點

right sort───正確排序

quick knife───快刀

quick dissolve───快速溶解

sort by───[計][WIN,NT]排序依據，排序方式，主要關鍵字

quick drop───快速下降

quick buck───容易到手、尤其是以不正當手段得來的金錢；容易到手的錢

雙語使用場景

asynchronous parallel quick sort algorithm, analyzes the sorting process, gives the multi-thread implment, points out the executing feature.───分析快速排序異步并行算法的排序過程，給出快速排序異步并行算法的多線程實現方式，指出算法多線程實現的特性。

This article proposes a quick sort method based on the machine code of floating point numbers, which can sort the floating point numbers distributed at random.───本文提出一種可對任意分布的浮點數進行排序的快速排序方法，它基于浮點數的機內編碼，具有速度快、實現簡單、實用的特點。

It's proved by algorithm analysis and experimental results that the new sorting algorithm is better than the quick sort when data are in little gap distribution.───算法分析和實驗結果都表明在待排序數據間隔不太大的情況下，遷移排序算法在速度上明顯優于快速排序算法。

Quick sort (Quicksort) is a bubble sort of an improvement.───快速排序（Quicksort）是對冒泡排序的一種改進。

Application exchange ranking basic idea of the main sorting methods : Bubble sort and quick sort.───應用交換排序基本思想的主要排序方法有：冒泡排序和快速排序。

Document contains two procedures, the first implementation of the Hill sort, quick sort, heap sort, binary search.───文檔包含兩個程序，第一個實現了希爾排序、快速排序、堆排序、折半查找。

Directly into the sort simple selection sort bubble sort quick sort heap sort.───簡單選擇排序；冒泡排序；快速排序；堆排序。

Write a function to achieve Hill sort or quick sort, etc. more efficient algorithms.───編寫函數，實現希爾排序或快速排序等效率較高的算法。

Based on the discussion of quick sort algorithm, a new algorithm, position computing, is proposed.───本文在研究快速排序法的基礎上，提出了一種新的算法———位置計算法。

英語使用場景

Wish you can benefit from sentencedict.com and make progress everyday!

A new practical "in-place" sorting algorithm, called super quick sort, is obtained by merging some characteristics of radix sort and quick sort.

Quick sort (Quicksort) is a bubble sort of an improvement.

Heapsort is a kind of quick sort algorithm, the minimum(or maximum) can be found by the greedy algorithm.

On the further research of quick sort algorithm and position computing algorithm, the latter one is improved and optimized, thus more effective in data processing.

This article proposes a quick sort method based on the machine code of floating point numbers, which can sort the floating point numbers distributed at random.

It's proved by algorithm analysis and experimental results that the new sorting algorithm is better than the quick sort when data are in little gap distribution.

To speed up computation, we use Quick Sort algorithm and Insertion Sort algorithm instead of usually used Heap Sort algorithm.

Directly into the sort simple selection sort bubble sort quick sort heap sort.