快速排序

#include<iostream>#include<vector>using namespace std;void quick_sort(int a[], int left, int right){int i = left;int j = right;int key = a[i];if (i > j){  //有跳出啊return;}while (i < j){while (i<j && key<a[j]){j--;}if (i < j){a[i] = a[j];i++;}while (i < j && key >= a[i]){i++;}if (i < j){a[j] = a[i];j--;}}a[i] = key;quick_sort(a, 0, i - 1);quick_sort(a, i + 1, right);}int main(){int a[] = { 1, 2, 4, 3, 5, 7, 6 };quick_sort(a, 0, 6);for (int i = 0; i < 7; i++){cout << a[i] << ",";}getchar();return 0;}