排序方法 冒泡法 優化排序法

import java.util.Arrays;

public class Test {
	public static void main(String[] args) {
		int[] ary1 = { 1, 6, 5, 8, 9, 2 };
		Arrays.sort(ary1);
		System.out.println(Arrays.toString(ary1));

		int[] ary2 = { 1, 6, 5, 8, 9, 2 };
		Arrays.sort(ary2, 1, 3);
		System.out.println(Arrays.toString(ary2));

		int[] ary = { 1, 6, 5, 8, 9, 2, 6, 12, 7 };
		for (int i = 0; i < ary.length - 1; i++) {
			for (int j = i + 1; j < ary.length; j++) {
				if (ary[i] > ary[j]) {
					int temp = ary[j];
					ary[j] = ary[i];
					ary[i] = temp;
				}

			}
		}

		System.out.println(Arrays.toString(ary));

		int[][] dary = { { 1, 2 }, { 2 }, { 2, 3, 7 } };
		System.out.println(Arrays.deepToString(dary));
	}
}

 

 

結果

[1, 2, 5, 6, 8, 9]
[1, 5, 6, 8, 9, 2]
[1, 2, 5, 6, 6, 7, 8, 9, 12]
[[1, 2], [2], [2, 3, 7]]