Submission #14066

#	Time	Username	Problem	Language	Result	Execution time	Memory
14066		sleep4725	버블 정렬 (OJUZ10_bubblesort)	C11	34 / 100	1000 ms	1476 KiB

bubblesort

#include<stdio.h>
#include<stdlib.h>
int main(void)
{
	int i, j, k,m;
	int a;
	int b;
	int temp = 0;
	int c = 0;
	scanf("%d %d", &a, &b);
	int* arr = NULL;
	arr = (int*)malloc(sizeof(int)*a);
	for (i = 0; i < a; i++)
	{
		scanf("%d", &arr[i]);
	}
	while (1)
	{
		if (c == b)
		{
			break;
		}
		for (k = 0; k < a - 1; k++)
		{
			if (arr[k]>arr[k + 1])
			{
				temp = arr[k];
				arr[k] = arr[k + 1];
				arr[k + 1] = temp;

			}
		}
		c++;
	}
		for (m = 0; m < a; m++)
		{
			printf("%d ", arr[m]);
		}
		printf("\n");
	
	return 0;
}

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