一种数组排序算法

void
IntArray::
sort( int low, int high )
{
    if ( low >= high ) return;
    int lo = low;
    int hi = high + 1;
    int elem = _ia[low];

    for ( ;; ) {
         while ( _ia[++lo] < elem ) ;
         while ( _ia[--hi] > elem ) ;
         if ( lo < hi )
              swap( lo,hi );
         else break;
    } 

    swap( low, hi );
    sort( low, hi-1 );
    sort( hi+1, high );
}