quickly sort

Yesterday I do Astar .Solved the first problem.Now record some import alogrithms I consider.

Quick sort.Here I don't need to say more.It's so familiar.It always performances well.

//quickly sort
int partition(BL langs[],int low,int high);
void Qsort(BL langs[],int low,int high);

int partition(BL *langs,int i,int j)
{
    int low=i;
    int high=j;
    char pk[10];
    char record[255];
    strcpy(pk,langs[i].f);
    strcpy(record,langs[i].s);
    //***********************************
    while(low<high)
    {
        while((low<high) && (strcmp(pk,langs[high].f)>=0))
            high=high-1;
        strcpy(langs[low].f,langs[high].f);
        strcpy(langs[low].s,langs[high].s);
        while((low<high) && (strcmp(pk,langs[low].f)<=0))
            low=low+1;
        strcpy(langs[high].f,langs[low].f);
        strcpy(langs[high].s,langs[low].s);
    }
    strcpy(langs[low].f,pk);
    strcpy(langs[low].s,record);
    return low;
}
void Qsort(BL *langs,int low,int high)
{
    int i;
    if(low<high)
    {
        i=partition(langs,low,high);
        Qsort(langs,low,i-1);
        Qsort(langs,i+1,high);
    }
}

struct BaiduLang
{
    char f[10];
    char s[255];
};
typedef struct BaiduLang BL;