QuickSort(C) 

 1 void QuickSort( int * Array,int ileft,int iright )
 2 {
 3     assert( Array != NULL );
 4     if ( ileft < iright )
 5     {
 6         int iDataend = Array[iright];
 7         int i,j,temp;
 8         i = ileft-1;
 9         j = ileft;
10         for ( ;j<=iright;j++ )
11         {
12             if( Array[j]<=iDataend )
13             {
14                 temp = Array[j];
15                 Array[j] = Array[++i];
16                 Array[i] = temp;
17             }
18         }
19         QuickSort( Array,ileft,i-1 );
20         QuickSort( Array,i+1,iright );
21     }
22 }

 

posted @ 2013-05-07 22:16  zhouyoulie  阅读(168)  评论(0)    收藏  举报