| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 19230 | middleageddr | 짝수 정렬 (tutorial3) | C++98 | 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.
#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);
	}
}
