排序算法：快速排序

原创

shanql 2022-12-07 15:07:45 博主文章分类：算法 ©著作权

文章标签 ios #include .net 文章分类 数据结构与算法人工智能

©著作权归作者所有：来自51CTO博客作者shanql的原创作品，请联系作者获取转载授权，否则将追究法律责任

#include <iostream>
using namespace std;


int Partition( int nArray[], int iLow, int iHigh )
{
  int pivotKey = nArray[iLow];
  while ( iLow < iHigh )
  {
    while( iLow < iHigh && nArray[iHigh] >= pivotKey ) 
      --iHigh;
    nArray[iLow] = nArray[iHigh];

    while( iLow < iHigh && nArray[iLow] <= pivotKey )
      ++iLow;
    nArray[iHigh] = nArray[iLow];

  }
  nArray[iLow] = pivotKey;

  return iLow;
}

void QuickSort( int nArray[], int iLow, int iHigh )
{
  if ( iLow >= iHigh )
  {
    return;
  }

  int nPartitionIndex = Partition( nArray, iLow, iHigh );

  QuickSort( nArray, iLow, nPartitionIndex );
  QuickSort( nArray, nPartitionIndex + 1, iHigh );
}

void PrintArray( int nArray[], int nCount )
{
  for ( int i= 0; i < nCount; ++i )
  {
    cout << nArray[i] << " ";
  }
  cout << endl;
}


int main()
{
  int nArray[20] = { 9, 12, 0, 1, 2, 34, 22, 3, 1, 2, 4, 12, 45, 0, 1, 2, 3, 54, 11, 50 };

  QuickSort( nArray, 0, 19 );

  PrintArray( nArray, 20 );

  return 0;
}