数据结构 快速排序

#include <stdio.h>
#include <malloc.h>
typedef struct { int e ; } qnode;
typedef struct { int length ; qnode * qns ; } qlist;
void qlist_init ( qlist * , int * , int);
void qlist_print(qlist *);
int part_sort(qlist * , int , int );
void quick_sort( qlist * , int  , int  );

int main ()
{
 int arr[] = { 4 , 7 , 5 , 0 , 1 , 8 , 9 , 3 , 6 ,2 };
 int length = sizeof(arr)/sizeof(int);
 qlist ql ;
 qlist_init(&ql , arr , length);
 quick_sort( &ql , 0 , length );
 qlist_print(&ql);
 getchar();    
}

void qlist_init ( qlist *ql , int *arr , int length )
{
 ql->length = length;
 ql->qns = ( qnode * ) malloc ( sizeof(qnode) * length );
 int i ; 
 for( i = 0 ; i < length ; i++)
 {
  (ql->qns + i)->e = *(arr+i);      
 }
}

void qlist_print(qlist *ql)
{
 int i ;
 for ( i = 0 ; i < ql->length ; i++)
 {
  printf("%d - " , (ql->qns + i)->e );
 }    
}

int part_sort(qlist *ql , int low , int high )
{
 qnode mid = *(ql->qns + low);
 while (low < high )
 {
  while(low < high && ( ql->qns + high )->e >= (&mid)->e )
   high--;
  *(ql->qns + low) =  *(ql->qns + high);
  while(low < high && ( ql->qns + low )->e <= (&mid)->e )
   low++;
  *(ql->qns + high) =  *(ql->qns + low);
 }
 *(ql->qns + low) = mid ;
 return low;
}

void quick_sort( qlist *ql , int low , int high )
{
 int mid = part_sort(ql , low , high);
 if(mid != low)
  quick_sort(ql , low , mid-1);
 if(mid != high)
 quick_sort(ql , mid+1 , high);
}