C/C++排序之二（直接插入排序、 折半插入排序、归并排序（递归））

直接插入排序、 折半插入排序、归并排序

4、直接插入排序insertion_sort

#include <iostream>

void insertion_sort(int *begin, int *end)
{
    int *i, *j, temp;
    for(i = begin + 1; i <= end; i ++)
    {
        temp = *i;
        for(j = i - 1 ; j >= begin; j --)
        {
            if(temp < *j)
                *(j + 1) = *j;
            else
                break;
        }
        *(j + 1) = temp;
    }
}
int main()
{
    int data[] = {1, 3, 12, 5, 13, 8, 0, 2, 7};
    insertion_sort(data + 0, data + 8);
    for(int *i = data; i <= data + 8; i ++)
    {
        std::cout << *i << " ";
    }
    std::cout << std::endl;
    return 0;
}

5、折半插入排序binary_insertion_sort

#include <iostream>

void binary_insertion_sort(int *begin, int *end)
{
    int *i, *j, *low, *high;
    for(i = begin + 1; i <= end; i ++)
    {
        int temp = *i;//临时存储
        //寻找插入位置
        for(low = begin, high = i - 1 ; low <= high; )
        {
            int *middle = low + (high - low)/2;
            if(temp < *middle)
                high = middle -1;
            else
                low = middle + 1;
        }
        //向后移
        for(j = i - 1; j >= high + 1; j --)
            *(j + 1) = *j;
        //插入
        *(j + 1) = temp;
    }
}
int main()
{
    int data[] = {1, 3, 12, 5, 13, 8, 10, 2, 7};
    binary_insertion_sort(data + 0, data + 8);
    for(int *i = data; i <= data + 8; i ++)
    {
        std::cout << *i << " ";
    }
    std::cout << std::endl;
    return 0;
}

6、归并排序（递归算法） merge_sort

#include <iostream>

//将两个有序表归并为一个有序表
void merge(int *begin, int *mid, int *end, int *temp)
{
    int *l_begin = begin;
    int *l_end = mid;
    int *r_begin = mid + 1;
    int *r_end = end;
    int i = 0;
    while(l_begin <= l_end && r_begin <= r_end)
    {
        if(*l_begin > *r_begin)
        {
            temp[i] = *r_begin;
            i ++;
            r_begin ++;
        }
        else
        {
            temp[i] = *l_begin;
            i ++;
            l_begin ++;
        }
    }

    while(l_begin <= l_end)
    {
        temp[i] = *l_begin;
        i ++;
        l_begin ++;
    }

    while(r_begin <= r_end)
    {
        temp[i] = *r_begin;
        i ++;
        r_begin ++;
    }

    while(begin <= end)
    {
        *begin = *temp;
        begin ++;
        temp ++;
    }
}

//
void merge_sort_recursive(int *begin, int *end, int *temp)
{
    if(end - begin > 0)
    {
        int *mid = begin + (end - begin) / 2;
        merge_sort_recursive(begin, mid, temp);
        merge_sort_recursive(mid + 1, end, temp);
        merge(begin, mid, end, temp);
    }
}

//
void merge_sort(int * begin, int * end)
{
    if(end - begin > 0)
    {
        int * temp = new int[end - begin + 1];

        merge_sort_recursive(begin, end, temp);

        delete [] temp;
    }
}

int main()
{
    int data[] = {7, 8, 5, 12, 3, 2, 1, 0, 10};

    merge_sort(data + 0,  data + 8);

    for(int i = 0; i < 8; ++ i)
    {
        std::cout << data[i] << " ";
    }
    std::cout << std::endl;
    return 0;
}