In scientific computation sometimes,it needs to sort the large fragmentcontinuity-sequential *** the characteristics of the data,based on extreme-points,a stable quick sort algorithm for fragment-continuity-sequential...
详细信息
In scientific computation sometimes,it needs to sort the large fragmentcontinuity-sequential *** the characteristics of the data,based on extreme-points,a stable quick sort algorithm for fragment-continuity-sequential data is given by using the binary-search for homing position,two-way passed and directed *** the fragmentcontinuity-sequential data,its efficiency is far higher than that of elementary sorts,and this is about 14 as high as that of Shell's sort and about 47 times as high as that of Heap sort.
暂无评论