๐ŸŒท๐ŸŒผ๋ชจ์—ฌ๋ด์š” ๊ฐœ๋ฐœ์˜์ˆฒ๐ŸŒท๐ŸŒผ

[JAVA/์ฝ”๋”ฉํ…Œ์ŠคํŠธ] ์„ ํƒ์ •๋ ฌ ๋ณธ๋ฌธ

๊ฐœ๋ฐœ/์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ฌธ์ œํ’€์ด JAVA

[JAVA/์ฝ”๋”ฉํ…Œ์ŠคํŠธ] ์„ ํƒ์ •๋ ฌ

์š”์ผ์ด 2021. 6. 18. 19:59
๋ฐ˜์‘ํ˜•

์„ค๋ช…

N๊ฐœ์ด ์ˆซ์ž๊ฐ€ ์ž…๋ ฅ๋˜๋ฉด ์˜ค๋ฆ„์ฐจ์ˆœ์œผ๋กœ ์ •๋ ฌํ•˜์—ฌ ์ถœ๋ ฅํ•˜๋Š” ํ”„๋กœ๊ทธ๋žจ์„ ์ž‘์„ฑํ•˜์„ธ์š”.

์ •๋ ฌํ•˜๋Š” ๋ฐฉ๋ฒ•์€ ์„ ํƒ์ •๋ ฌ์ž…๋‹ˆ๋‹ค.

์ž…๋ ฅ

์ฒซ ๋ฒˆ์งธ ์ค„์— ์ž์—ฐ์ˆ˜ N(1<=N<=100)์ด ์ฃผ์–ด์ง‘๋‹ˆ๋‹ค.

๋‘ ๋ฒˆ์งธ ์ค„์— N๊ฐœ์˜ ์ž์—ฐ์ˆ˜๊ฐ€ ๊ณต๋ฐฑ์„ ์‚ฌ์ด์— ๋‘๊ณ  ์ž…๋ ฅ๋ฉ๋‹ˆ๋‹ค. ๊ฐ ์ž์—ฐ์ˆ˜๋Š” ์ •์ˆ˜ํ˜• ๋ฒ”์œ„ ์•ˆ์— ์žˆ์Šต๋‹ˆ๋‹ค.

์ถœ๋ ฅ

์˜ค๋ฆ„์ฐจ์ˆœ์œผ๋กœ ์ •๋ ฌ๋œ ์ˆ˜์—ด์„ ์ถœ๋ ฅํ•ฉ๋‹ˆ๋‹ค.

์˜ˆ์‹œ ์ž…๋ ฅ 1 

6 13 5 11 7 23 15

์˜ˆ์‹œ ์ถœ๋ ฅ 1

5 7 11 13 15 23

 

์„ ํƒ์ •๋ ฌ ์„ค๋ช…๋„

import java.util.*;

public class Main {
	
	public void solution(int n, int[] array) {
		
		int first = 0;
		int tmp = 0;
		int count = 0;
		for(int i=0; i<n; i++) {
			// ๋งจ ์•ž์˜ ์ž๋ฆฌ ๋ฐฐ์—ด์„ ์ €์žฅ
			first = array[i];
			tmp = array[i];
			count = i;
			for(int j=i; j<n; j++) {
				if(tmp > array[j]) {
					tmp = array[j];
					count = j;
				}
			}
			
			array[count] = first;
			array[i] = tmp;
		
			System.out.print(array[i] + " ");
		}
		
	}
	
	public static void main(String args[]) {
        Main main = new Main();
		
        Scanner in= new Scanner(System.in);
        
        int n = in.nextInt();
        int[] array = new int[n];
        
		for(int i=0; i<n; i++) {
			array[i] = in.nextInt();
		}
		
        main.solution(n, array);
    }

}
Comments