Submission #19231

#TimeUsernameProblemLanguageResultExecution timeMemory
19231middleageddr짝수 정렬 (tutorial3)C++98
100 / 100
0 ms1084 KiB
#include "grader.h" void q_sort(int left, int right, int *A) { int i, j, pivot; int temp; i = pivot = left; j = right; if (i < j) { while (i < j) { while ((i < j) && (*(A + i) < *(A + pivot))) i++; while ((i < j) && (*(A + j) >= *(A + pivot))) j--; if (i < j) { temp = *(A + i); *(A + i) = *(A + j); *(A + j) = temp; } } temp = *(A + pivot); *(A + pivot) = *(A + j); *(A + j) = temp; q_sort(left, j - 1, A); q_sort(j + 1, right, A); } } void sort_even(int N, int *A) { int i; q_sort(0, N - 1, A); for (i = 0; i < N; i++) { if (A[i] % 2 == 0) Report(A[i]); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...