[심심풀이 백준문제풀기] 2750번 수 정렬하기 (버블정렬)

문제 : https://www.acmicpc.net/problem/2750

import java.util.Scanner;
 
public class Main {
    static int[] bubleSort(int[] array) {
        int[] result = new int[array.length];
            for(int i = array.length ; i > 1 ; i -- ) {
                for(int j = 0 ; j < i-1 ; j++ ) {
                    if(array[j]>array[j+1]) {
                        int temp = array[j+1];
                        array[j+1] = array[j];
                        array[j] = temp;
                    }
                    
                }
            }
        result = array;
        return result;
    }
    
    public static void main(String[] args) {
 
        Scanner scan = new Scanner(System.in);
        int count = 0;
        int num = scan.nextInt();
        int[] arr = new int[num];
        for (int i = 0; i < num; i++) {
            arr[count] = scan.nextInt();
            count++;
        }
        // int[] arr = {5,3,4,7,6,2,1};
        for (int a : bubleSort(arr)) {
            System.out.println(a);
        }
 
        scan.close();
    }
}