[Java] 삽입 정렬 (Insertion Sort)

삽입 정렬

 

 
import java.util.Scanner;
 
class Solution {
 
    static int input[];
    static int num;
 
    static void insertionSort()
    {
        for (int i = 1; i < num; i++)
        {
            int temp = input[i];
            int j = i - 1;
 
            while ((temp < input[j]) && (j >= 0))
            {
                input[j + 1] = input[j];
                j = j - 1;
            }
            input[j + 1] = temp;
        }
    }
 
    static void printResult()
    {
        int i;
 
        for (i = 0; i < num; ++i)
        {
            System.out.print(input[i] + " ");
        }
        System.out.println();
    }
 
    public static void main(String arg[]) throws Exception {
        Scanner sc = new Scanner(System.in);
 
        int T = sc.nextInt();
 
        for (int test_case = 1; test_case <= T; test_case++)
        {
            num = sc.nextInt();
             
            input = new int[num];          
            for (int i = 0; i < num; i++)
            {
                input[i] = sc.nextInt();
            }
 
            insertionSort();
 
            System.out.print("#" + test_case + " ");
            printResult();
        }
 
        sc.close();
    }
}