插入排序
public class ArrayUtil {
/**
*
* @param array
*/
public static void printArray(int [] array){
System.out.print("{");
for(int i = 0;i < array.length;i++){
System.out.print(array[i]);
if(i < array.length - 1){
System.out.print(",");
}
}
System.out.println("}");
}
}
public class InsertSort {
public static void insertSort(int[] array) {
if (array == null || array.length < 2) {
return;
}
for (int i = 0; i < array.length; i++) {
int currentValue = array[i];
int position = i;
for (int j = i - 1; j >= 0; j--) {
if (array[j] > currentValue) {
array[j + 1] = array[j];
position = position - 1;
} else {
break;
}
}
array[position] = currentValue;
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] a = { 49, 38, 65, 97, 76, 13, 27, 49, 78, 34, 12, 64, 1 };
ArrayUtil.printArray(a);
insertSort(a);
ArrayUtil.printArray(a);
}
}

浙公网安备 33010602011771号