#include<bits/stdc++.h>
using namespace std;
int B[10010];
int Partion(int A[], int low, int high)
{
int pivot = A[low];
while (low < high) {
while (low < high && A[high] >= pivot)--high;
A[low] = A[high];
while (low < high && A[low] <= pivot) ++low;
A[high] = A[low];
}
A[low] = pivot;
return low;
}
void QuickSort(int A[], int low, int high)
{
if (low < high) {
int pivotpos = Partion(A, low, high);
QuickSort(A, low, pivotpos - 1);
QuickSort(A, pivotpos + 1, high);
}
}
int main()
{
int A[] = { 9,8,7,6,5,4,3,2,1,0 };
QuickSort(A, 0, 9);
for (int k : A)
{
cout << k << " ";
}
}
Processed:
0.009, SQL:
9
