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.