제출 #14954

#제출 시각아이디문제언어결과실행 시간메모리
14954abcd123버블 정렬 (OJUZ10_bubblesort)C11
34 / 100
1000 ms1356 KiB
#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"); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...