void quickSortByRecursion(int *p, int length) //传递数组指针跟数组长度 { int *left = p; //第一个值设为中间值 int *right = p + length - 1; if (left < right) //当左边点指针小于右边的指针继续递归 { while (left < right) { while

#define _CRT_SECURE_NO_WARNINGS #include #include #include #define N 1000000 using namespace std; inline void swap(int *a, int *b) { if (a != b) { *a = *a^*b; *b = *a^*b; *a = *a^*b; }