{
while (i<j &&R[j].key>=avg) j--; if (i<j) R[i]=R[j];
while (i<j &&R[i].key<=avg) i++; if (i<j) R[j]=R[i];
}
 
if(R[i].key<=avg) return    i;
else return    i-1;
}
void quicksort (RecType R[],int S,T);
{
if (S<T)
{
k=partition (R,S,T); quicksart (R,S,k); quicksart (R,k+1,T);
}
}