# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
2656 | domece | 짝수 정렬 (tutorial3) | C11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
void sort_even(int N, int *A){
int i,j;
qsort(A,N,4,c);
for(i=0;i<N;i++){
int tmp=A[i];
int index=i;
for(j=1;j<N;j++){
if(tmp>A[j]) tmp=A[j],index=j;
}
A[i]^=A[index]^=A[i]^=A[index];
if(A[i]%2==0) Report(A[i]);
}
}