冒泡、选择、插入排序

                int ary[] = { 2, 4, 1, 3, 5, 6, 9, 7, 10, 8, 15, 23, 12, 11 };
		int[] ary2 = { 2, 4, 1, 3, 5, 6, 9, 7, 10, 8, 15, 23, 12, 11 };
		int[] ary3 = { 2, 4, 1, 3, 5, 6, 9, 7, 10, 8, 15, 23, 12, 11 };

		// 选择排序
		for (int i = 0; i < ary.length - 1; i++) {
			for (int j = i + 1; j < ary.length; j++) {
				if (ary[i] > ary[j]) {
					int t = ary[i];
					ary[i] = ary[j];
					ary[j] = t;
				}
			}
		}
		System.out.println(Arrays.toString(ary));

		// 冒泡排序
		for (int i = 0; i < ary2.length - 1; i++) {
			for (int j = 0; j < ary2.length - i - 1; j++) {
				if (ary2[j] > ary2[j + 1]) {
					int t = ary2[j];
					ary2[j] = ary2[j + 1];
					ary2[j + 1] = t;
				}
			}
		}
		System.out.println(Arrays.toString(ary2));

		// 插入排序
		for (int i = 1; i < ary3.length; i++) {
			int temp = ary3[i];
			int j;
			for (j = i - 1; j >= 0 && temp < ary3[j]; j--) {
				ary3[j + 1] = ary3[j];
			}
			ary3[j + 1] = temp;
		}
		System.out.println(Arrays.toString(ary3));