- #include "stdafx.h"
- #include "iostream"
- using namespace std;
- const int MAX_ELEMENTS = 100;
- void quicksort(int low, int high, int num[]) {
- if (low >= high) {
- return;
- }
- int first = low, last = high, key = num[low];
- while (first < last) {
- while (first < last && key <= num[last]) {
- last--;
- }
- num[first] = num[last];
- while (first < last && num[first] <= key) {
- first++;
- }
- num[last] = num[first];
- }
- num[first] = key;
- quicksort(low,first-1,num);
- quicksort(first + 1, high, num);
- }
- void print(int n, int num[]) {
- for (int i = 0; i < n; i++) {
- cout << num[i] << " ";
- }
- }
- int main()
- {
- int i, n, num[MAX_ELEMENTS];
- cin >> n;
- for (i = 0; i < n; i++) {
- cin >> num[i];
- }
- quicksort(0, n - 1, num);
- print(n,num);
- return 0;
- }
- //该片段来自于http://www.codesnippet.cn/detail/1612201514231.html
来源: http://www.codesnippet.cn/detail/1612201514231.html