|
快速排序（quick sort）
程序代码
#include
using namespace std;
void quickSort(int* a, int left, int right) {
if (left > right) return;
int i = left, j = right;
int temp = a[i]; //选取基准数
while (i != j) { //交换中间的数
while (i < j && temp = a[i]) i++;
if (i < j) { //交换两个数
int t = a[j];
a[j] = a[i];
a[i] = t;
}
}
//交换基准数
if (i == j) {
a[left] = a[i];
a[i] = temp;
}
quickSort(a, left, i - 1);
quickSort(a, i + 1, right);
}
int main() {
int a[10], n = 0;
memset(a, 0, sizeof(a));
cin >> n;
for (int i = 1; i > a[i];
quickSort(a, 1, n);
for (int i = 1; i |