快速排序（c++代码）

解题思路:

注意事项:

参考代码:

const int MAX = 10;

int arr[MAX];

void qsort(int l, int r) {

if (l > r)return;

int i = l, j = r;

int base = 0;

base = arr[l];

while (i < j) {

while (i<j && arr[j]>=base) {

j--;

}

while (i < j && arr[i] <= base) {

i++;

}

if (i < j) {

int temp = 0;

temp = arr[j];

arr[j] = arr[i];

arr[i] = temp;

}

}

arr[l] = arr[i];

arr[i] = base;

qsort(l, i-1);

qsort(i+1, r);

}

int main() {

int length = 10;

for (int i = 0; i < length; i++)

{

cin >> arr[i];

if (arr[i] == 0) {

break;

}

}

qsort(0, MAX - 1);

for (int  i = 0; i < length; i++)

{

if (arr[i] == 0) {

continue;

}

cout << arr[i] << endl;

}

cin.get();

cin.get();

}