思想
对插入排序的改进,进行多次插入排序,只不过每次插入排序的步长不是1,而分别是n/2,n/4,n/8, ...,1
C代码
#include "stdio.h"
void array_printf(int a[],int n);
void sort_shell_insert(int a[],int n,int d);
void sort_shell(int a[],int n);
int main()
{
int i,a[] = {5,4,3,2,10,1,9,8,6,0};
sort_shell(a,sizeof(a)/sizeof(int));
array_printf(a,sizeof(a)/sizeof(int));
return 0;
}
void array_printf(int a[],int n){
int i ;
for (i = 0; i < n; ++i)
{
printf("%d ",a[i]);
}
printf("\n");
}
void sort_shell_insert(int a[],int n,int d){
// core thought:
//divide a array into n groups ,each index as follows:
// 0 , 0+d, 0+2d , ....
// 1 , 1+d, 1+2d , ...
// 2 , 2+d, 2+2d ,
// ...
// d-1, d-1+d ,
// in each group , do insert sorting , from [d] to [n-1]
int i,j ,x;
for(i = d; i<n ; i++){
// in each group ,begin to do insert sorting
if(a[i]<a[i-d]){
x = a[i];
j = i-d;
while( j >=0 && x<a[j]){
a[j+d] = a[j];
j-=d;
}
a[j+d] = x;
}
}
}
void sort_shell(int a[],int n){
int i = n/2;
while(i>=1){
sort_shell_insert(a,n,i);
i/=2;
}
}
java代码
import java.util.List;
public class SortShell implements Sort {
@Override
public void sort(List<Integer> source) {
int d= source.size()/2;
while(d>0){
// shell insert
for(int i = d; i<source.size(); i ++){
int x = source.get(i);
int j = i-d;
if( x > source.get(j))
continue;
while( j>=0 && source.get(j) > x ){
source.set(j+d, source.get(j));
j = j-d;
}
source.set(j+d, x);
}
d = d/2;
}
}
}