public class charupaixu {
public static void insertsort(int[] a){
int temp;
for(int i=1;i<a.length;i++){
int j=i-1;
while(j>=0){
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
j--;
}
}
System.out.println("排序后的数组为:");
for(int i=0;i<a.length;i++){
System.out.print(a[i]+" ");
}
}
public static void main(String[] args){
int[] array=new int[]{78,23,1,45,67,98,14,54,3,33};
System.out.println("排序之前的数组为:");
for(int i=0;i<array.length;i++)
{
System.out.print(array[i]+" ");
}
System.out.println();
insertsort(array);
}
}
public static void insertsort(int[] a){
int temp;
for(int i=1;i<a.length;i++){
int j=i-1;
while(j>=0){
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
j--;
}
}
System.out.println("排序后的数组为:");
for(int i=0;i<a.length;i++){
System.out.print(a[i]+" ");
}
}
public static void main(String[] args){
int[] array=new int[]{78,23,1,45,67,98,14,54,3,33};
System.out.println("排序之前的数组为:");
for(int i=0;i<array.length;i++)
{
System.out.print(array[i]+" ");
}
System.out.println();
insertsort(array);
}
}