insertion sort

插入排序：

package sort;/** * @author DQJK * @date 2009-8-8 * insertion sort increased * **/public class InsertionSort{private int[] arr;public InsertionSort(int[] arr){this.arr = arr ;}private void sort(){if(arr.length == 0) return;int count = 0;//j is index of just handled numfor(int j = 1;j < arr.length; j++ ){int key = arr[j];int i = j - 1;//if you want decreased sorted,just change the '>' to '<'while (i >= 0 && arr[i] > key){count ++;arr[i+1] = arr[i];i -= 1 ;}arr[i+1] = key;}System.out.println("count:" + count);}public int[] getSortedArray(){sort();return arr;} public void print(){if(arr.length == 0) return;for(int i = 0; i < arr.length ; i++){System.out.print(arr[i] + "/t");}System.out.println();}public static void main(String [] args){System.out.println(Math.floor(9.6));int[] al = {5,2,4,6,1,3};InsertionSort is = new InsertionSort(al);is.print();is.getSortedArray();is.print();}}