C++排序算法5种

#include <iostream>
using namespace std;

void swap(int &a, int &b)
{
    int temp;
    temp = a;
    a = b;
    b = temp;
}

void bubbleSort(int * x, int N)
{
    for (int i = 0; i < N; i++)
    {
        for (int j = 1; j < N-i; j++)
        {
            if (x[j]>x[j-1])
            {
                swap(x[j], x[j - 1]);
            }
        }
    }
}

//void bubbleSort1(int * x, int N)
//{
//  for (int i = 0; i < N; i++)
//  {
//      for (int j = N-1; j > i; j--)
//      {
//          if (x[j]<x[j-1])
//          {
//              swap(x[j], x[j - 1]);
//          }
//      }
//  }
//}

void selectSort(int * x, int N)
{
    for (int i = 0; i < N; i++)
    {
        int xmin = x[i];
        int cur = i;
        for (int j = i; j < N; j++)
        {
            if (xmin > x[j])
            {
                cur = j;
                xmin = x[j];
            }
        }
        swap(x[cur], x[i]);
    }
}

int OnceSort(int * x, int start, int end)
{
    //int i = start;
    //int pivot = x[start];
    //for (int j = start + 1; j <= end; j++)
    //{
    //  if (x[j]<=pivot)
    //  {
    //      i++;
    //      swap(x[i], x[j]);
    //  
    //  }
    //}
    //swap(x[i], x[start]);
    //return i;

    int i = start, j = end;
    if (i >= j) return 0;
    while (i<j)
    {
        while (i < j && x[i] <= x[j]) --j;
        if (i < j) swap(x[i], x[j]);

        while (i < j && x[i] <= x[j]) ++i;
        if (i < j) swap(x[i], x[j]);

    }
    return i;
}

void quickSort(int * x, int start,int end)
{
    if (start<end)
    {
        int pivot = OnceSort(x, start, end);

        quickSort(x, start, pivot - 1);
        quickSort(x, pivot + 1, end);
    }


}

void insertSort(int * x, int N)
{
    for (int i = 0; i < N; i++)
    {
        for (int j = i; j > 0; j--)
        {
            if (x[j]<x[j-1])
            {
                swap(x[j], x[j - 1]);
            }
        }
    }
}

void MergeSort(int * x, int N, int start, int end)
{
    if (start >= end)return;
    int len = end - start;
    int mid = (len >>1) + start;

    int start1 = start, end1 = mid;
    int start2 = mid+1, end2 = end;

    MergeSort(x, N, start1, end1);
    MergeSort(x, N, start2, end2);

    int * reg= new int [50];
    int k = start;

    while (start1<=end1 && start2<=end2)
    {
        reg[k++] = x[start1] < x[start2] ? x[start1++] : x[start2++];
    }

    while (start1<= end1)
    {
        reg[k++] = x[start1++];
    }
    while (start2 <= end2)
    {
        reg[k++] = x[start2++];
    }

    for (int i = start; i <= end; i++)
    {
        x[i] = reg[i];
    }

    delete[] reg;
}

int main()
{
    int x[50], number, N = 0, count = 1, choice = 0;
    do
    {
        cin >> number;
        x[N] = number;
        N++;
    } while ((cin.get() != '\n') && (N < 50));

    cout << "the unput quence:" << endl;
    for (int i = 0; i < N; i++)
    {
        cout << x[i] << " ";
    }

    cout << '\n' << "the way: 0 bubbleSort; 1 selectSort; 2 quickSort; 3 insertSort: 4 MergeSort" << endl;
    cin >>choice;

    //bubbleSort(x, N);
    //selectSort(x, N);
    //quickSort(x, 0, N - 1);
    //insertSort(x, N);
    //MergeSort(x, N, 0, N - 1);

    switch (choice)
    {
    case 0:
        bubbleSort(x, N);
    case 1:
        selectSort(x, N);
    case 2:
        quickSort(x, 0, N - 1);
    case 3:
        insertSort(x, N);
    case 4:
        MergeSort(x, N, 0, N - 1);
    default:
        cout << "what? byebye" <<endl;
    }

    cout << '\n' << "the output quence:" << endl;
    for (int i = 0; i < N; i++)
    {
        cout << x[i] << " ";
    }

}

先贴代码，以后有空再加文字和注释，加油