快速排序算法

目前，我们实现的转换系统已经可以把C语言描述的一些经典算法转换为Java程序，如最短路径算法，快速排序算法等。

Now , transformation system we implemented has already transformed some typical algorithms described by c such as shortest path algorithm , quick sort algorithm into Java program .

程序采用了C++的标准模板库（STL，StandardTemplateLibrary），涉及到的数据结构有向量，集合和快速排序算法等。

In the process of the implementation , we use the STL , Standard Template Library , of C + + , and some data structures , such like vector , set and quick sort algorithm .

链表结构快速排序算法一种减轻HDTVSOC软件负载的方法&硬件链表方法

QUICK SEQUENCING METHOD WITH LINKED LIST An Approach to Release the Software Load in HDTV SoC & Link-list Mechanism

快速排序算法的平均时间小于所有已知的O（nlogn）排序算法。

The average running time of quick sort is less than that of all other currently known 0 ( nlogn ) sorting algorithms . Its average time is O ( nlogn ), and its performance is O ( n ~ 2 ) in the worst case .

如何在快速排序算法中定义趟的概念

How to Define the Concept of " Pass " in Quicksort Algorithm

对冒泡排序和快速排序算法的改进

Improvement on the Algorithm for Bubble Sort and Quick Sort

基于特定范围的关键字的快速排序算法

Fast Sorting Algorithm Based on Keywords in a Given Scope

B-快速排序算法的研究与应用

Research and Application of B - Quick Sorting Algorithm

概率统计分档快速排序算法

A new algorithm for statistical classification and quick sorting

按位链接快速排序算法

A Quick Sorting Algorithm for Unit and Linking

一种新的快速排序算法&位置计算法

A New Quick Sort Algorithm & Position Computing

快速排序算法的微机应用程序

An Application Program of Quick Sorting Algorithm

二维数组的快速排序算法

Quick Sorting Algorithm of Two dimensional Array

快速排序算法的时间复杂性的新分析

New Time-Complexity Analysis of the Quick-Sorting Algorithm

链表结构快速排序算法

Quick sequencing method with linked list

NOW系统上的并行快速排序算法

Parallel quick sort algorithm on now

一种B-快速排序算法

A B & Quick Sorting Algorithm

一种实型数据的快速排序算法

A Quick Sorting Algorithm of Real

快速排序算法研究

A Study on Quicksort Algorithm

识别运动链拓朴结构的邻接链表法链表结构快速排序算法

Identification of Isomorphism of Kinematic Chains Using Link 's Adjacent Chain Table QUICK SEQUENCING METHOD WITH LINKED LIST

本文提出了一种集地址排序与基数排序优点于一体的具有比传统快速排序算法性能更高的排序方法，全文给出了该算法的描述、部分源程序、时间/空间复杂度分析。

In this paper , a address-radix-sorting algorithm which is higher in performance than traditional ones has been established .

提出了给定待排数据概率分布函数情况下的概率统计分“档”快速排序算法。

Under the condition of given data statistical distribution , a new algorithm for statistical classification and quick sorting was implemented .

在最小走时节点查寻中，结合使用快速排序算法与插入排序算法，替代以往方法中多采用的堆排序算法；

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

对快速排序算法，基于枢轴元素的随机选取这一前提条件，对这一算法进行了时间平均性能的分析。

To the problem of quick-sort , the authors give an average capacity analysis of the algorithm which is based on random choice ' pintle ' .

基于支持向量机的元件故障率预测算法根据天气和电网潮流的变化预测元件故障率的变化，为系统故障状态快速排序算法提供输入数据。

The prediction algorithm based on support vector machine provide revised data for the system state fast sorting algorithm according to the changes of weather and power flow .

利用信息系统的优势关系和粒计算的方法获取优势粒，将优势粒粒度作为多目标排序和适应度赋值的依据，并设计了基于优势粒的快速排序算法，可极大地降低排序运算量。

The dominance granule can be obtained by the dominance relation in the information system and granulation computing . It is the basis of multi-objective sorting and fitness assignment .

本课题将后缀数组技术引入搜索引擎中，优化并应用后缀快速排序算法，解决了全文索引的时间问题。

In this paper Suffix Array is employed for Full-Text indexing and with the optimizing Suffix Fast Sorting Algorithm , we can solve the problem of time for Full-Text searching .

提出一种新的Byte－快速排序算法，其排序的速度比B－快速排序算法及快速排序算法要快，且稳定性好。

This paper presents a Byte - quick sorting algorithm . The speed , and the stability of Byte & quick sorting algorithm are more better than B - quick sorting algorithm and quick sorting algorithm .

划分算法是快速排序算法中的重要组成部分，本文讨论了划分算法的几种形式，将通常的双循环形式的算法改写成单循环形式的算法。

Partition algorithm is an important part in quick sort algorithms . Some forms of partition algorithm are discussed , and the usual algorithm of partition in double while repetition structure is rewritten to single while repetition structure form .

并在同等的条件下，用该方法与快速排序算法对相同的内容进行排序，结果表明：该算法特别适用于大文本的排序问题，可用于搜索技术和数据压缩中。

If this method and traditional sort algorithm is used in the same condition and the same question , the experiments show that it is very suitable to the large text and the method may be used in searching technology and data compression .