[정올 1157] 버블정렬

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&code=1157&sca=99 

JUNGOL

#include <stdio.h>

int N, ar[105];

int main(void)
{
	scanf("%d", &N);
	for (int i = 0; i < N; i++)		scanf(" %d", ar + i);

	for (int i = N - 1; i > 0; i--)
	{
		for (int j = 0; j < i; j++)
		{
			if (ar[j] > ar[j + 1])
			{
				int tmp = ar[j];
				ar[j] = ar[j + 1];
				ar[j + 1] = tmp;
			}
		}
		for (int i = 0; i < N; i++)		printf("%d ", ar[i]);
		printf("\n");
	}
	return 0;
}