자바 버블정렬

 

package ch2;
import java.util.Scanner;

public class study1 {
	public static void main(String[] args) {
		
		Scanner a = new Scanner(System.in);
		int b = a.nextInt(); //배열의 개수
		int list[]=new int [b]; //배열 선언
		for (int i = 0 ; i<list.length; i++)
			list[i]=a.nextInt();//배열 입력
		for (int j = 0; j< list.length ; j++)
		{
			for (int i =0 ; i<list.length-1; i++)
			{
				if (list[i]>list [i+1])
				{
					int temp = list [i];
					list [i] = list [i+1];
					list [i+1] = temp; //서로 교환
				}
			}
		}		
		for (int i =0 ; i<list.length ; i++)
			System.out.print(list[i]+" ");				
	}	
}