C++排序算法

 

#include <iostream.h>

void SelectSort(int arr[], int len)
{
    for (int i=0; i<len-1; i++)
    {
        int min = i;
        for (int j=i+1; j<len; j++)
        {
            if (arr[j] < arr[min])
            {
                min = j;
            }
        }
        int temp = arr[i];
        arr[i] = arr[min];
        arr[min] = temp;
    }
}

void InsertSort(int arr[], int len)
{
    for (int i=1; i<len; i++)
    {
        int tmp = arr[i];
        for (int j=i-1; j>=0 && tmp<arr[j]; j--)
        {
            arr[j+1] = arr[j];
        }
        arr[j+1] = tmp;
    }
}

void BubbleSort(int arr[], int len)
{
    for (int i=len-1; i>0; i--)
    {
        bool exchanged = false;
        for (int j=0; j<i; j++)
        {
            if (arr[j] > arr[j+1])
            {
                int tmp = arr[i];
                arr[i] = arr[j];
                arr[j] = tmp;
                exchanged = true;
            }
        }
        if (!exchanged)
        {
            return;
        }
    }

}

/**********快速排序*********************/

void QuickSort(int R[],int low,int high)

{

   int pivotpos;

   if(low<high)

   {

     pivotpos=Partition(R,low,high);

     QuickSort(R,low,pivotpos-1);

     QuickSort(R,pivotpos+1,high);

   }

}

int Partition(int R[],int i,int j)

{

  int pivot=R[i];

  while(i<j)

  {

    while(i<j&&R[j]>=pivot)j--;

    if(i<j)

      R[i++]=R[j];

    while(i<j&& R[i]<=pivot)i++;

    if(i<j)

      R[j--]=R[i];

  }

  R[i]=pivot;

  return i;

}

/*****************************************/

void main()
{
    int ii;
    int arr[] = {4,5,6,3,8,9,5,1};
    int len = sizeof(arr) / sizeof(arr[0]);
//    SelectSort(arr, len);
//    InsertSort(arr, len);
//    BubbleSort(arr, len);
    QuickSort(arr, 0, len-1);
    for (ii=0; ii<len; ii++)
        cout<<arr[ii]<<'/t';
    cout<<endl<<endl;
}