Java 선택 정렬 알고리즘 구현

import java.util.Scanner;

 

public class Exercise {

     public static void main(String[] arg) {

          int[] arr = new int[10];

          Scanner sc = new Scanner(System.in);

          for (int i = 0; i < 10; i++) {

              arr[i] = sc.nextInt();

          }

          // 입력

          Sort(arr);

          // 출력

          for (int i = 0; i < 10; i++) {

              System.out.println(arr[i]);

          }

     }

 

     public static void Sort(int[] a) {

          int n = 10;

          int temp;

          int j;

          boolean move;

          for( int i = 1; i < n ; i = i + 1)

          {

              temp = a[i];

              j = i;

              if( a[j-1] > temp )

              {

                   move = true;                

              }

              else

              {

                   move = false;

              }

              while(move)

              {

                   a[j] = a[j-1];

                   j = j - 1 ;

                   if( j > 0 && a[j-1] > temp)

                   {

                        move = true;

                   }

                   else

                   {

                        move = false;

                   }

              }

              a[j] = temp;

          }

         

     }

}