递归实现快速排序

/*

    分裂：将数组分为两部分，前一部分小于poivt，后一部分大于

*/

int CRecursion::split(int ary[], int low, int high)

{

 int x = ary[low];

 int i = low;

 int k=0;

 CLibrary m_Library;

 for(k = low+1; k <= high; k++)

 {

  if(ary[k] < x)

  {

   i = i+1;

   m_Library.swap(ary[k], ary[i]);

  }

 }

 m_Library.swap(ary[low], ary[i]);

 return i;

}

/*

    调用split，用递归实现快速排序

*/

void CRecursion::split_sort(int ary[], int low, int high)

{

 if(low < high)

 {

     int k = split(ary, low, high);

     split_sort(ary, low, k-1);

     split_sort(ary, k+1, high);

 }

}

 

void main()

{

 /////////////////////////////////////////////

 ////////     递归实现快速排序     ////////////

 int ary[9] = {8, 3, 6, 2, 1, 9, 4, 5, 7};

 int low = 0, high = 9-1;

 CRecursion m_Recursion;

 m_Recursion.split_sort(ary, low, high);

 for(int i = low; i <= high; i++)

  cout << ary[i] << "  ";

 

 getchar();

 return 0;

}