public static <E extends Comparable> void sort(E[] arr) {
for (int i = 0; i < arr.length; i++) {
E temp = arr[i];
int j;
for (j = i; j >= 1 && temp.compareTo(arr[j - 1]) < 0; j--) {
arr[j] = arr[j - 1];
}
arr[j] = temp;
}
}
public static <E extends Comparable> void sort2(E[] arr) {
for(int i = arr.length - 1; i >= 0; i --){
E t = arr[i];
int j;
for(j = i; j + 1 < arr.length && t.compareTo(arr[j + 1]) > 0; j ++){
arr[j] = arr[j + 1];
}
arr[j] = t;
}
}
时间复杂度O*O