[JAVA] 백준 2750번 - 수 정렬하기

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

2750번: 수 정렬하기

 

 

거품 정렬

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main{
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(br.readLine());
        int[] arr = new int[n];

       for(int i=0; i<n; i++){
           arr[i] = Integer.parseInt(br.readLine());
       }
       for(int i=0; i<n-1; i++){
           for(int j=0; j<n-i-1; j++){
               if(arr[j]>arr[j+1]){
                   int tmp = arr[j];
                   arr[j] = arr[j+1];
                   arr[j+1] = tmp;
               }
           }
       }
       for(int x : arr){
           System.out.println(x);
       }
    }
}

 

 

 

 

삽입 정렬

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main{
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(br.readLine());
        int[] arr = new int[n];

       for(int i=0; i<n; i++){
           arr[i] = Integer.parseInt(br.readLine());
       }

       for(int i=1; i<n; i++){
           int tmp = arr[i];
           int j;
           for(j=i-1; j>=0; j--){
               if(arr[j]>tmp) arr[j+1]=arr[j];
               else break;
           }
           arr[j+1] = tmp; // j가 멈춘 지점의 뒤에 tmp를 넣음
       }

       for(int x : arr){
           System.out.println(x);
       }
    }
}