插入排序

package wuxue;


public class insertsort implements shuzu {
 private int sorts[];
 private int n;
 public insertsort() {
// 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 temp,j;
for(int i=1;i<n;i++)
{
temp=sorts[i];
 for( j=i;j>0;j--)
 {
 if(temp>=sorts[j-1])break;
 else   sorts[j]=sorts[j-1];
 }
 sorts[j]=temp;
}
}
private void prints()
{ System.out.print("插入排序：");
for(int i=0;i<n;i++)
System.out.print(sorts[i]+" ");
System.out.println();
}
}