插入排序

但对极不均匀数据则退化成低效的O（N2）插入排序。

It sorts uniform data efficiently within O ( N ) time but degrades to the inefficient O ( N 2 ) insertion sort when handling extremely-nonuniform data .

插入排序还是冒泡排序？

Insertion sort or bubble sort ?

本文在分析链式插入排序算法的基础上，给出了具体的C程序实例。

On the basis of analyzing the linked inserting sort , this article gives a specific example of C program .

为方便G代码的输出，减少加工过程中的起落刀次数，在数据存入时采用了链表插入排序算法。

Insertion-sorting algorithm of link is adopted while data are stored , which would be convenient for output of G code and reduce the number of up-and-down of cutter as well .

通过对传统Dijkstra算法进行速度分析，在此基础上采用插入排序思想对Dijkstra算法进行了改进，使原算法得到了优化，改进了网络最短路径的计算过程，提高了算法的执行效率。

Through analyzing Dijkstra algorithm 's executing speed , The insert sorting method is used to improve it , which optimizes the traditional algorithm and improves the calculation process , and reduces its consuming time .

一种新的2-路插入排序算法

A New Method of 2 - Way Insertion Sort

多插入排序算法族

A Group of Multi - insertion Sort Algorithm

与精度归档插入排序算法研究的商榷

The Discussion of Study of the Insertion Sort Algorithm of Filing According the Precision

两趟插入排序算法设计

Designing an Algorithm of Two Order Insertion Sort

链式插入排序算法分析

Analysis on Sort Algorithm of Linked Inserting

利用线性链表实现对用户输入的一组数据进行插入排序。

Use of a linear chain to achieve a set of user input data insertion sort .

4路插入排序法

Four - way Insertion Sort Method

一种新的分档置换插入排序算法

A Group of Multi-insertion Sort Algorithm

并在其中思考利用直接插入排序算法对查询结果进行排序。关键字：录入，查询，修改，排序。

And in among pondered the use direct insertion sort algorithm carries on the arrangement to the inquiry result .

这种插入排序算法不论时间复杂度还是空间复杂度，相对原2-路插入排序算法都有较好的改善。

The asymptotic time complexity and better space complexity of this method of insertion sort are better than original ones .

根据所用数据结构的特点，算法中用了插入排序的思想并对其进行了改进，以降低时间上的开销。

By the characteristic of data structure in this thesis , insertion sort is used and improved in the algorithm .

基于此，本文提出了一种由分“档”、整体置换和局部直接插入排序所组成的新排序算法&分“档”置换插入排序法。

In this paper , a new sorting algorithm consisted of classification , in situ permutation and straight insertion is presented .

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

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

详细分析2-路插入排序算法，给出了一种改进的2-路插入排序算法及其实现。

This paper analyzes the method of 2-way insertion sort in detail with a new method of 2-way insertion sort and its realization .

排序是程序设计中非常重要的内容，其方法有很多，常用的有三种：冒泡排序、选择排序和插入排序。

Sorting is very important in programming , and there are many methods , such as bubble sort , selection sort , insertion sort , etc.

通过对选择排序、起泡排序和插入排序等三种排序法的比较与评价，得出较优的排序法。

Through a comparison and an evaluation of the three sorting algorithms of the selection sort , the bubble sort and the insertion sort , we can see which is the best .

在分析了传统二分插入排序算法性能的基础上，给出了一种二分双插入排序算法，这种排序算法使时间性能得到了极大改善。

By analyzing the algorithm of traditional binary insertion sort , the author presents an algorithm of binary double insertion sort which will improve the performance of sort about the time complexity .

分析、讨论和比较了排序的三种通用算法，即交换排序法、选择排序法和插入排序法，同时也提供了一种改进的排序算法&快速排序法。

In the paper we discuss and compare the three sorts of general algorithm of data sorting , that is to say , exchanging sorting , selective sorting and insertive sorting . an improved and fast method of algorithm is also provided .

然后利用信息熵原理分析了插入排序和归并排序的效率，指出当序列长度大于4时，任何直接插入排序的比较次数大于理论下界。

Then the efficiency of the insertion sort and merging sort algorithms are analyzed by means of entropy , and it is pointed out that when the length of the series is larger than 4 , any sorting algorithm based on direct comparison requires more comparisons than the lower bound .

未能进行大容量插入。排序的列''%1！''无效。将假定数据流未排序。

Could not bulk insert . Invalid sorted column ' % . ls ' . Assuming data stream is not sorted .

本文首先提出一种谓之代码转换、分档统计转移插入的新排序方法（以下简称分档插入排序法）。

A new sorting method , the method of code-transformation , graded computing and insertional relocations ( GCIR ) is presented .

设法用减少插入序列长度的办法，提出一种快速插入的排序方法。

This paper puts forward to a sort method of quick insertion through trying to shorten the length of insertion sequence .