while (low<high & L->elem(high>=k) high-- >elem[low]=L->elem[high] while(low<high & L->elem[low=k) low++ ->elem high]=L->elem[low] L->elem[low]=L->elem[0 return(low) Elem Type middle(s table*L, int low, int high if (low<high) s= fun(L, low, high); if(s-==(high-low)/2) return (L->elem[) if(s>(high-low)/2) return(middle(l, low, S-1)) return(middle(l, s+l, high));8 { while (low<high && L->elem[high]>=k) high--; L->elem[low] = L->elem[high] ; while (low<high && L->elem[low]<=k) low++; L->elem[high] = L->elem[low] ; } L->elem[low] =L->elem[0]; return(low) ; } ElemType middle(S_table*L, int low , int high ) { if (low<high) { s = fun(L,low,high); if (s==(high-low)/2 ) return (L->elem[s]) ; if (s>(high-low)/2) return(middle(L,low,s-1)) ; else return(middle(L,s+1,high)); } }