JAVA 排序O（n2）

 

// 从小到大
	public static Integer[] bubbleSort(Integer[] array) {
		for (int i = 0; i < array.length; i++) {
			for (int j = i + 1; j < array.length; j++) {
				if (array[i] > array[j]) {
					int temp = array[i];
					array[i] = array[j];
					array[j] = temp;
				}
			}
		}
		return array;
	}

 // 从小到大9,8,7

 

	public static Integer[] selectSort(Integer[] array) {
		for (int i = 0; i < array.length; i++) {
			int minIndex = i;
			for (int j = i + 1; j < array.length; j++) {
				if (array[j] < array[minIndex]) {
					minIndex = j;
					int temp = array[i];
					array[i] = array[j];
					array[j] = temp;
				}
			}
		}
		return array;
	}

 // 从小到大

	public static Integer[] insertSort(Integer[] array) {
		for (int i = 1; i < array.length; i++) {
			int value = array[i];
			int position = i;
			while (position > 0 && array[position - 1] > value) {
				array[position] = array[position - 1];
				position--;
			}
			array[position] = value;
		}
		return array;
	}