基础算法-插入排序

/**
*插入排序算法
*/
public class InsertionSort{
public static void main(String args[]){
int[] array = new int[]{10,2,5,6,8,2,49,23,50,2,33,25,11,21};
long begin = System.currentTimeMillis();
insertionSort(array);
long end = System.currentTimeMillis();
System.out.println("\ntake time:"+(end-begin)+"ss");
}

public static void insertionSort(int[] array){
for(int i=1;i<array.length;i++){
if(array[i-1]>array[i]){
for(int j=i-1;j>=0;j--){
if(array[j]>array[j+1]){
int key = array[j+1];
array[j+1]=array[j];
array[j]=key;
}else{
break;
}
}
}
//print(array,i);
}
print(array,array.length);
}

private static void print(int[] array,int loopindex){
System.out.println();
System.out.print((loopindex+1)+"==>:");
for(int i=0;i<array.length;i++){
System.out.print(array[i]);
if(i+1<array.length){
System.out.print(",");
}
}
}
}