[SWEA][JAVA] 1966. 숫자를 정렬하자

package level_2;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;

public class SW_1970 {

	public static void main(String[] args) throws NumberFormatException, IOException {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		StringTokenizer st;
		int T = Integer.parseInt(br.readLine());

		for (int test_case = 1; test_case <= T; test_case++) {
			int N = Integer.parseInt(br.readLine());
			int[] arr = new int[N];
			st = new StringTokenizer(br.readLine());
			for (int n = 0; n < N; n++) {
				arr[n] = Integer.parseInt(st.nextToken());
			}
//			for (int a : arr) {
//				System.out.print(a + " ");
//			}
//			System.out.println();
			for (int a = 0; a < arr.length; a++) {
				for (int b = 0; b < arr.length - a - 1; b++) {
					if (arr[b] > arr[b + 1]) {
						int temp = arr[b + 1];
						arr[b + 1] = arr[b];
						arr[b] = temp;
					}

				}
			}
//			for (int a : arr) {
//				System.out.print(a + " ");
//			}
//			System.out.println();
//			for(int a = 0; a < arr.length; a++) {
//				for(int b = 0; b < arr.length -a-1; b++) {
//					if(arr[b] < arr[b+1]) {
//						int temp = arr[b];
//						arr[b] = arr[b+1];
//						arr[b+1] = temp;						
//					}
//				}
//			}
//			for (int a : arr) {
//				System.out.print(a + " ");
//			}
			bw.write("#" + test_case + " ");
			for (int a : arr) {
				bw.write(a + " ");
			}
			bw.write("\n");
		}
		bw.flush();
		bw.close();
	}

}

정렬 API만 써보다가 직접 정렬을 구현해봤다.