public static void quickSort(int[] a, int left, int right) {
int f, t;
int rtemp, ltemp;
ltemp = left;
rtemp = right;
f = a[(left + right) / 2];
while (ltemp < rtem...
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int a[maxn],n;
int parti(int a[],int l,int r)
{
int x=a[l];//以第一个为基准
while(l<r)
{
while(l<r...
