来一曲插播如何,铛铛~~ 这就是插入排序的代码
public class Insertion{
public static void sort(Comparablep[] a){
for(int i = 1; i < a.length; i++){
for(int j = i; j > 0; j--){
if(greater(a[j-1], a[j])){
exch(a, j-1, j);
}else{
break;
}
}
}
}
private static boolean greater(Comparable v, Comparable w){
return v.compareTo(w) > 0;
}
private static void exch(Comparable[] a, int i, int j){
Comparable temp;
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}