find job(快速排序)

/****/* 快速排序void q_sort(int l,int r){     if(l >= r)return;    int left = l,rig = r,x = s[l];    while(left < rig){        while(left < rig && s[rig] >= x) rig --;        if(left < rig) s[left++] = s[rig];        while(left < rig && s[left] < x)left++;        if(left < rig) s[rig--] =s[left] ;    }    s[left] = x;    q_sort(l,left-1);    q_sort(left+1,r);}*//////