A Stable Quick Sort Algorithm (SQSA) for fragment-continuity-sequential data

摘要

In scientific computation, sometimes, it is necessary to sort large fragment-continuity-sequential data. Considering the characteristics of the data, a new sort algorithm is given by using the binary search for a homing position, two-way passed and directed homing. It is proved that the average efficiency of the new sort of algorithm for fragment-continuity-sequential data is relatively high.