public class DirectInsertSort {
/**
* 直接插入排序算法
* @param strVoid
*/
void directInsertSort(int[] strVoid)
{
int temp;
for(int i=1;i<strVoid.length;i++)
{
temp = strVoid[i];
int j = i-1;
while(j>=0)
{
if(strVoid[j]>temp)
{
strVoid[j+1]=strVoid[j];
j--;
}else{
break;
}
}
strVoid[j+1]=temp;
}
}
public static void main(String[] args){
int[] strVoid=new int[]{11,66,22,0,55,22,0,32};
DirectInsertSort sort=new DirectInsertSort ();
sort.directInsertSort(strVoid);
for(int i=0;i<strVoid.length;i++)
{
System.out.print(strVoid[i]+" ");
}
}
}