希尔排序

package wuxue;

public class shellsort implements shuzu {
 private int sorts[];
 private int n;
 public shellsort() {
	// TODO Auto-generated constructor stub
	 n=shuzu.length;
	 sorts=new int[n];
	for(int i=0;i<n ;i++)
	{
		sorts[i]=shuzu[i];
	}
	sort();
	prints();
}
 private void sort()
 {
	 int dlta[]={7,5,3,2,1};
	 for(int m:dlta)
	 sort_1(sorts,m);
	 
 }
private void sort_1(int sorts[],int k)
{
	int temp,j;
	for(int i=k;i<n;i++)
	{
		if(sorts[i]<sorts[i-k])
		{
		temp=sorts[i];
	  for( j=i;j-k>=0;j-=k)
	  {
		  if(temp>=sorts[j-k])break;
		  else   sorts[j]=sorts[j-k];
	  }
	  sorts[j]=temp;
	  }
	 	
	}
}
private void prints()
{
	System.out.print("希尔排序：");
for(int i=0;i<n;i++)
	System.out.print(sorts[i]+" ");
System.out.println();
}
}