排序算法@c++描述-插入排序

1.插入排序

普通版本

#include 
#include 
#include 

using namespace std;

template 
void insertionSort(vector &a)
{
    int i;
    for (int j = 1; j < a.size(); j++) {
        T tmp = a[j];
        for (i = j; i > 0 && tmp < a [i - 1]; i--)
            a[i] = a[i - 1];
        a[i] = tmp;
    }
}

int main()
{
    vector test = {190, 435, 834, 8954, 923, 56, 20 ,1, 934};
    clock_t time_stt = clock();
    insertionSort(test);
    cout << "Total time: " << 1000 * (clock() - time_stt) / (double)CLOCKS_PER_SEC << "ms" << endl;
    for (auto i : test)
        cout << i << " ";
    cout << endl;
    return 0;
}

• 运行结果：

$ ./a.out
Total time: 0.002ms
1 20 56 190 435 834 923 934 8954

---

STL实现版本(模仿STL sort() 接口)

#include 
#include 
#include 

using namespace std;

// 模仿STL sort()接口

template 
void insertionSort(const Iterator &begin, const Iterator &end, Functor func, const Object &obj)
{
    Iterator i;
    for (Iterator j = begin + 1; j != end; j++) {
        Object tmp = *j;
        for (i = j; i != begin && func(tmp, *(i - 1)); i--)
            *i = *(i - 1);
        *i = tmp;
    }
}

template 
void insertionSort(const Iterator &begin, const Iterator &end, Functor func)
{
    insertionSort(begin, end, func, *begin);
}

template 
void _insertionSort(const Iterator &begin, const Iterator &end, const Object &obj)
{
    insertionSort(begin, end, less