5일 차 JAVA 정렬방식

import java.util.Scanner;

public class Test21 {

public static void main(String[] args) {

int[] arr = { 5, 3, 1, 2, 8, 7, 0, 9, 6, 4 };

int min;

int minposition;

for (int j = 0; j < arr.length; j++) {

min = arr[j];

minposition = j;

for (int i = j; i < arr.length; i++) {

if (arr[i] < min) {

min = arr[i];

minposition = i;

}

}

int temp = arr[minposition];

arr[minposition] = arr[j];

arr[j] = temp;

for (int i = 0; i < arr.length; i++)

System.out.print(arr[i] + " ");

System.out.println();

}

}

}

결과

0 3 1 2 8 7 5 9 6 4 

0 1 3 2 8 7 5 9 6 4 

0 1 2 3 8 7 5 9 6 4 

0 1 2 3 8 7 5 9 6 4 

0 1 2 3 4 7 5 9 6 8 

0 1 2 3 4 5 7 9 6 8 

0 1 2 3 4 5 6 9 7 8 

0 1 2 3 4 5 6 7 9 8 

0 1 2 3 4 5 6 7 8 9 

0 1 2 3 4 5 6 7 8 9 

출처: 삼성SDS멀티캠퍼스 

강사: 홍승길

Email : iccack70@gmail.com