1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65
| #include <iostream> using namespace std;
void swap(int& a, int& b) { int temp; temp = a; a = b; b = temp; }
void quick_sort(int* a, int start, int end) { if (start >= end) return; int key = a[(start + end) / 2]; int i = start, j = end; while (i <= j) { while (a[i] < key) i++; while (a[j] > key) j--; if (i <= j) { swap(a[i], a[j]); i++; j--; } } quick_sort(a, start, j); quick_sort(a, i, end); }
int main() { int n; cout << "please input the number count you want to sort: "; cin >> n; int* a = new int[n]; cout << "please input the number, seperate with space" << endl; for (int i = 0; i < n; i++) cin >> a[i]; quick_sort(a, 0, n - 1); cout << "the sort result is: "; for (int i = 0; i < n; i++) cout << a[i] << " "; cout << endl; delete []a; system("pause"); return 0; }
|