Its process flowcharts and experimental results in BASIC and PASCAL are given. Its time complexity is O(N) and the extra memory cost is 2N + 2(N is the quantity of the data) when the data are in equidistribution.

• 给出排序算法、流程图和用BASIC及PASCAL语言编写程序进行实验的结果,算法分析和实验结果都表明在被排数据均匀分布的情况下,该排序方法的时间复杂性为O(N),附加存贮开销为2N+2(N为数据量),并且该排序方法在速度上明显快于QUICK SORT法。