[JAVA] 풀스택 개발자 부트캠프 008일차 ⑤ sorting Program 재구성

public class MainClass {

    public static void main(String[] args) {

        Sorting sor = new Sorting();
        sor.input();
        sor.sort();
        sor.print();
    }
}

 

import java.util.Scanner;

public class Sorting {

    int[] number;
    int updown;

    void input(){
        Scanner sc = new Scanner(System.in);

        System.out.print("정렬 수의 갯수 = ");
        int count = sc.nextInt();

        number = new int[count];

        for (int i = 0;i < number.length; i++){
            System.out.print((i + 1) + "번째 수 = ");
            number[i] = sc.nextInt();
        }

        System.out.print("오름(1) 내림(2) = ");
        updown = sc.nextInt();
    }

    void sort(){
        for (int i = 0;i < number.length-1; i++){
            for (int j = i + 1;j < number.length; j++){
                if(updown == 1){
                    if(number[i] > number[j]){
                        swap(i, j);
                    }
                }
                else{
                    if(number[i] < number[j]){
                        swap(i, j);
                    }
                }
            }
        }
    }

    void print(){
        for (int num : number){
            System.out.print(num + "\t");
        }
    }

    void swap(int i, int j){
        int temp = number[i];
        number[i] = number[j];
        number[j] = temp;
    }

}