插入排序算法
1、java代码实现
package com.pers.lxb;
public class Insertion {
public static Comparable[] sort(Comparable[] array){
int len=array.length;
for (int i = 1; i <len; i++) {
for (int j = i; j >0 ; j--) {
if(bigger(array[j-1],array[j])){
exchange(array,j,j-1);
}else{
break;
}
}
}
return array;
}
public static boolean bigger(Comparable a,Comparable b){
return a.compareTo(b)>0;
}
public static void exchange(Comparable[] array,int i,int j){
Comparable temp=array[i];
array[i]=array[j];
array[j]=temp;
}
}