public static void insertionSort (int[] array) {
		if (array == null || array.length <= 1) {
			return ;
		}
		
		int insertNum;
		int i, j;
		for (i = 1; i < array.length; i++) {
			insertNum = array[i];
			for (j = i - 1; j >= 0 && array[j] > insertNum; j--) {
				array[j + 1] = array[j];
			}
			array[j + 1] = insertNum;
		}
	}