to speed up computation, we use quick sort algorithm and insertion sort algorithm instead of usually used heap sort algorithm.
在最小走时节点查寻中,结合使用快速排序算法与插入排序算法,替代以往方法中多采用的堆排序算法;
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.
算法分析和实验结果都表明在待排序数据间隔不太大的情况下,迁移排序算法在速度上明显优于快速排序算法。
directly into the sort simple selection sort bubble sort quick sort heap sort.
简单选择排序;冒泡排序;快速排序;堆排序。
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.
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.