2021-01-16

void qsort (int l,int r){
	int mid=a[(l+r)/2],i=l,j=r;
	do {
		while (a[i]<mid) i++;
		while(a[j]>mid) j--;
		if(i<=j){ swap(a[i],a[j]);i++,j--;} 
	}while (i<=j);
	if (l<j) qsort(l,j);
	if (i<r ) qsort(i,r);
}