Description
实现快速排序
Input Format
第一行输入一个数 N
第二行输入 N 个数构成待排序数组A
Output Format
输出排序好的N个元素,用空格隔开
Sample Input
5
5 4 3 2 1
Sample Output
1 2 3 4 5
Tips
按要求利用快速排序解决问题!
C++实现如下:
#include <iostream>
#define MaxSize 1000002
using namespace std;
template<class KEY, class OTHER>
struct SET {
KEY key;
OTHER other;
};
template<class KEY, class OTHER>
int divide(SET<KEY, OTHER> a[], int low, int high) {
SET<KEY, OTHER> k = a[low];
do {
while (low < high && a[high].key >= k.key) --high;
if (low < high) {
a[low] = a[high];
++low;
}
while (low < high && a[low].key <= k.key) ++low;
if (low < high) {
a[high] = a[low];
--high;
}
} while (low != high);
a[low] = k;
return low;
}
template<class KEY, class OTHER>
void quickSort(SET<KEY, OTHER> a[], int size) {
quickSort(a, 0, size - 1);
}
template<class KEY, class OTHER>
void quickSort(SET<KEY, OTHER> a[], int low, int high) {
int mid;
if (low >= high) return;
mid = divide(a, low, high);
quickSort(a, low, mid - 1);//排序左一半
quickSort(a, mid + 1, high);//排序右一半
}
SET<int, int> a[MaxSize];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i].key;
}
quickSort(a, n);
for (int i = 0; i < n; ++i) {
cout << a[i].key << " ";
}
return 0;
}