Submission #14954

#	Time	Username	Problem	Language	Result	Execution time	Memory
14954		abcd123	버블 정렬 (OJUZ10_bubblesort)	C11	34 / 100	1000 ms	1356 KiB

bubblesort

#include<stdio.h>

void main()
{
	int size,count,i,j,x;
	int num[100000];

	scanf("%d %d",&size,&count);

	for(i=0;i<size;i++)
		scanf("%d",&num[i]);

	//num[size] = '\0';

	for(j=0;j<count;j++){
		for(i=1;i<size;i++){
			if(num[i-1] > num[i]){
				x = num[i-1];
				num[i-1] = num[i];
				num[i] = x;
			}
		}
	}
	for(i=0;i<size;i++)
		printf("%d ",num[i]);

	//system("PAUSE");
}
	

• Subtask 1: 11 / 11
• Subtask 2: 23 / 23
• Subtask 3: 0 / 47
• Subtask 4: 0 / 19