#include <stdio.h> void _quick_sort(int* arr,int left,int right) { if(left >=right) return; int l=left,r=right; int p=(l+r)/2; int val=arr[p]; while(l<r) { while(l<p && arr[l]<=val) l++; if(l<p) { arr[p]=arr[l]; p = l; } while(r>p&&arr[r]>=val) r--; ...