非递归版的归并排序以及希尔排序

#include <iostream>
#include <vector>
#include <algorithm>

#define MAXSIZE 10

struct SqList
{
    int a[MAXSIZE + 1];//下标0用于哨兵
    int length;
};

//希尔排序,设置一个增量进行插入排序，插入排序的增量是1
void ShellSort(SqList &L)
{
    int cre = L.length;
    while(cre > 1)
    {
        cre = cre / 3 + 1;
        for(int i = 1; i <= L.length - cre; ++i)
        {
            int j = i + cre;
            if(L.a[j] < L.a[i])
            {
                L.a[0] = L.a[j];
                for(j = j - cre; L.a[j] > L.a[0] && j > 0; j -= cre)
                {
                    L.a[j + cre] = L.a[j];
                }
                L.a[j + cre] = L.a[0];
            }
        }
    }

}


void Merge(SqList &L, int p, int q, int r)
{
    std::vector<int> left(L.a + p, L.a + q + 1);
    left.push_back(65535);
    std::vector<int> right(L.a + q + 1, L.a + r + 1);
    right.push_back(65535);
    int i = 0, j = 0;
    for(int k = p; k <= r; ++k)
    {
        if(left[i] < right[j])
        {
            L.a[k] = left[i];
            ++i;
        }
        else
        {
            L.a[k] = right[j];
            ++j;
        }
    }
}

//归并排序的非递归版
void MSort(SqList &L)
{
    int d = 2;
    for(; d <= L.length; d *= 2)
    {
        int i = 1;
        for(; i <= L.length - d + 1; i = i + d)
        {
            int r = i + d - 1;
            int q = (i + r) / 2;
            Merge(L, i, q, r);
        }
    }
    if(d / 2 < L.length)
    {
        Merge(L, 1, d / 2, L.length);
    }
}

 int main()
{
    SqList L;
    L.length = 9;
    L.a[0] = 0;
    L.a[1] = 50;
    L.a[2] = 10;
    L.a[3] = 90;
    L.a[4] = 30;
    L.a[5] = 70;
    L.a[6] = 40;
    L.a[7] = 80;
    L.a[8] = 60;
    L.a[9] = 20;
    //ShellSort(L);
    //HeapSort(L);
    //MergeSort(L, 1, 9);
    MSort(L);
    system("pause");
    return 0;
}