常见排序算法——选择排序、冒泡排序、插入排序和原地排序

几个常见的排序算法

#include<iostream>
#include<algorithm>
#include<iterator>
using namespace std;

//选择排序
template<typename T>
void SelectionSort(T a[], int n)
{
    for(int size = n; size > 1; --size)
    {
        int indexOfMax = 0;
        for(int i = 1; i < size; ++i)
            if(a[indexOfMax] < a[i])
                indexOfMax = i; 
        swap(a[indexOfMax], a[size - 1]);
    }
}

//冒泡排序
template<typename T>
void BubbleSort(T a[], int n)
{
    for(int size = n; size > 1; --size)
    {
        for(int i = 0; i < size - 1; ++i)
        {
            if(a[i] > a[i + 1])
                swap(a[i], a[i + 1]); 
        }
    }
}
//插入排序
template <typename T>
void insertionSort(T a[], int n)
{
    for (int i = 1; i < n; ++i)
    {
        T t = a[i];
        int j;
        for (j = i - 1; j >= 0 && t < a[j]; --j)
            a[j + 1] = a[j];
        a[j + 1] = t;
    }
}
//按名次原地重排
template <typename T>
void RearrangeSort(T a[], int n, int r[])
{
    for (int i = 1; i < n; ++i)
        for (int j = 0; j < i; ++j)
        {
            if (a[i] > a[j])
                ++r[i];
            else
                ++r[j];
        }

    for (int i = 0; i < n; ++i)
    {
        while (i != r[i])
        {
            int t = r[i];
            swap(a[i], a[t]);
            swap(r[i], r[t]);
        }
    }
}

int main()
{
    int a[7] = { 3,2,6,5,9,4,8 };
    int b[7] = { 7,1,4,6,8,3,9 };
    int r[7];
    for (int i = 0; i < 7; ++i) //初始化r[7]，用于rank数组r
        r[i] = 0;

    copy(a, a + 7, ostream_iterator<int>(cout, " "));
    cout << endl;
    SelectionSort(a, 7);//or BubbleSort(a, 7)/insertionSort(a, 7)
    copy(a, a + 7, ostream_iterator<int>(cout, " "));
    cout << endl;    

    copy(b, b + 7, ostream_iterator<int>(cout, " "));
    cout << endl;    
    RearrangeSort(b, 7, r);
    copy(b, b + 7, ostream_iterator<int>(cout, " "));
    cout << endl;

    return 0;
}