2路插入排序借助辅助数组减少了插入过程的移动次数,通过循环数组,实现头尾两端都可以插入(所以叫2路插入排序)。
这个排序使用空间换时间
include"../init.h"
//二路插入
//循环数组
void Two_PathSort(RedType *node){
int i,j;
RedType list[MAXSIZE];
list[0] = node[1];
int first,final;
first = final = 0;
for(i = 2; i <= MAXSIZE; i++){
if(node[i].key > list[final].key)
list[++final] = node[i];
else if(node[i].key < list[first].key){
first = (first -1 + MAXSIZE) % MAXSIZE;
list[first] = node[i];
}else{
for(j=final++; node[i].key < list[j].key; j = (j -1 + MAXSIZE) % MAXSIZE)
list[(j+1+MAXSIZE)%MAXSIZE] = list[j];
list[(j+1+MAXSIZE)%MAXSIZE] = node[i];
}
}
for(i=1; i<=MAXSIZE; ++i,first = (first +1 + MAXSIZE) % MAXSIZE)
node[i] = list[first];
}
int main(){
Sqlist L;
init(&L);
Two_PathSort(L.r);
show(L.r);
}