선택정렬

import java.util.Scanner;

public class선택정렬 {
	public static void main(String args[]) {
		Scanner in = new Scanner(System.in);
		
		int n = in.nextInt();
		int arr[] = new int[n];
		for (int i = 0; i < n; i++) {
			arr[i] = in.nextInt();
		}
		int[] resArr = new선택정렬().solution(n, arr);
		for (int res : resArr) {
			System.out.print(res + " ");
		}
	}
	
	public int[] solution(int n, int[] arr) {
		for (int i = 0; i < n; i++) {
			int minIndex = i;
			for (int j = i; j < n; j++) {
				if (arr[minIndex] > arr[j]) {
					minIndex = j;
				}
			}
			
			if (minIndex != i) {
				int temp = arr[i];
				arr[i] = arr[minIndex];
				arr[minIndex] = temp;
			}
			
		}
		
		return arr;
	}
}