#include #define N 100010int n = 0;int a[N];void paixu(int a[], int left, int right) { if(left >= right) //如果指针相遇说明排完本轮，则开始返回递归 { return; } int i = left - 1; int j = right +...
