[Java] 버블정렬

import java.util.Arrays;

public class SortMethod {
	public static void main(String[] args) {
		SortMethod sort = new SortMethod();
		// 버블정렬 만들어놓은 메소드로 불러오기
		int[] num = { 67, 55, 9, 86, 98 };
		System.out.println(Arrays.toString(num));
		int[] result = sort.sort(num);
		System.out.println(Arrays.toString(result));

		System.out.println("----------------------");
		int[] num2 = { 10, 55, 37, 20, 98 };
		System.out.println(Arrays.toString(num2));
		int[] result2 = sort.sort(num2);
		System.out.println(Arrays.toString(result2));
	}

	/*
	 * public 	-> 접근 범위
	 * int[]	-> return type
	 * int[] arr-> 매개변수(파라미터)
	 * 
	 * return 반환 값.
	 */
	public int[] sort(int[] arr) {
		for (int i = 0; i < arr.length - 1; i++) {
			for (int j = 0; j < arr.length - 1; j++) {
				if (arr[j] < arr[j + 1]) {
					int temp = arr[j];
					arr[j] = arr[j + 1];
					arr[j + 1] = temp;
				}
			}
		}
		return arr;
	}
	public int[] sort2(int[] arr) {
		for (int i = 0; i < arr.length - 1; i++) {
			for (int j = 0; j < arr.length - 1; j++) {
				// 부등호 반대로 = 역순배열 
				if (arr[j] > arr[j + 1]) {	
					int temp = arr[j];
					arr[j] = arr[j + 1];
					arr[j + 1] = temp;
				}
			}
		}
		return arr;
	}
}