问双向链表的分区排序

EN

void quicksort(int *array, int left, int right)
{
    int v=array[(left+right)/2];
    int i,j,x;
    i=left;
    j=right;
    do {
        while (array[i]<v) i++;
        while (array[j]>v) j--;
        if (i<=j) {
            x=array[i];
            array[i]=array[j];
            array[j]=x;
            i++;
            j--;
        }
    } while (i<=j);
    if (j>left) quicksort(array, left, j);
    if (i<right) quicksort(array, i, right);
}

void partitonSort(node **head,node **tail)
{
    node *v; // here I want to use first or last element as pivot
    node *i,*j;
    do
    {
        while(i->key < v->key) i = i->next;
        while(j->key > v->key) j = j->prev;
        if(/*what boolean expression should I use here*/)
        {
            /*Is it necessary to replace swap operation 
              with insert and delete operations and 
              how to do it */
            i = i->next;
            j = j->prev;
        }
    }
    while(/*what boolean expression should I use here*/);
    if(/*what boolean expression should I use here*/)
           partitonSort(head,&j);
    if(/*what boolean expression should I use here*/)
           partitonSort(&i,tail);      
}