各种内部排序方法及效率分析。

一、  实验内容

1、对起泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序这六种常用排序算法进行比较。

2、待排序表的表长不超过100；其中数据用伪随机数产生程序产生。

3、至少要用6组不同的输入数据做比较。

4、要对实验结果做简单分析。

一、  源程序

#include<iostream>
#include<string>
#include<cstdlib>
using namespace std;
#define OK 1
#define OVERFLOW -1
#define ERROR 0
#define MAXSIZE 100
int typedef Status;
#define MAXSIZE 20
typedef int KeyType;
typedef struct{
    KeyType key;
    int otherinfo;
}RedType;
typedef struct{
    RedType r[MAXSIZE + 1];
    int length;
}SqList;
void InsertSort(SqList &L){//直接插入排序
    int i, j;
    for ( i = 2; i <= L.length; ++i)
        if (L.r[i].key < L.r[i - 1].key){
            L.r[0] = L.r[i];
            L.r[i] = L.r[i - 1];
            for (j = i - 2; L.r[0].key < L.r[j].key; --j)
                L.r[j + 1] = L.r[j];
            L.r[j + 1] = L.r[0];
            
        }
    
}
void ShellInsert(SqList &L, int dk){//希尔排序
    int i, j;
    for (i = dk + 1; i <= L.length;++i)
    if (L.r[i].key < L.r[i - dk].key){
        L.r[0] = L.r[i];
        for (j = i - dk; j>0 && L.r[0].key < L.r[j].key; j -= dk)
            L.r[j + dk] = L.r[j];
        L.r[j + dk] = L.r[0];
    }
}
void ShellSort(SqList &L, int dt[], int t){
    int k;
    for (k = 0; k < t; ++k)
        ShellInsert(L, dt[k]);
}
void BubbleSort(SqList &L){//冒泡排序
    int m = L.length - 1; int flag = 1;
    int j; RedType t;
    while ((m>0) && (flag == 1)){
        flag = 0;
        for (j = 1; j <= m; j++)
        if (L.r[j].key > L.r[j + 1].key){
            flag = 1;
            t = L.r[j]; L.r[j] = L.r[j + 1];
            L.r[j + 1] = t;
        }
        --m;
    }
}
void SelectSort(SqList &L){//简单选择排序
    int i;
    for (i = 1; i < L.length; ++i){
        int k;
        k = i;
        for (int j = i + 1; j <= L.length;++j)
        if (L.r[j].key < L.r[k].key)k = j;
        if (k != i)
        {
            RedType t;
            t = L.r[i]; L.r[i] = L.r[k]; L.r[k] = t;
        }
    }
}
int Partition(SqList &L, int low, int high){
    L.r[0] = L.r[low];
    int pivotkey;
    pivotkey = L.r[low].key;
    while (low < high){
        while (low < high&&L.r[high].key >= pivotkey)--high;
        L.r[low] = L.r[high];
        while (low < high&&L.r[low].key <= pivotkey)++low;
        L.r[high] = L.r[low];
    }
    L.r[low] = L.r[0];
    return low;
}
void QSort(SqList &L, int low, int high){
    if (low < high){
        int pivotloc;
        pivotloc = Partition(L, low, high);
        QSort(L, low, pivotloc - 1);
        QSort(L, pivotloc + 1, high);
    }
}
void QuickSort(SqList &L){//快速排序
    QSort(L, 1, L.length);
}
void HeapAdjust(SqList &L, int s, int m){
    RedType rc;
    rc = L.r[s];
    for (int j = 2 * s; j <= m; j *= 2){
        if (j < m&&L.r[j].key < L.r[j + 1].key)++j;
        if (rc.key >= L.r[j].key)break;
        L.r[s] = L.r[j]; s = j;

    }
    L.r[s] = rc;
}
void CreatHeap(SqList &L){
    int n = L.length;
    for (int i = n / 2; i>0; --i)
        HeapAdjust(L, i, n);
}
void HeapSort(SqList &L){//堆排序
    CreatHeap(L);
    for (int i = L.length; i > 1; --i){
        RedType x = L.r[1];
        L.r[1] = L.r[i];
        L.r[i] = x;
        HeapAdjust(L, 1, i - 1);
    }
}
int main(){
    SqList L;
    cout << "请输入 长度：" << endl;
    cin >> L.length;
    for (int i = 1; i <= L.length; i++){
        cout << "请输入 第" << (i ) << "个值：" << endl;
        cin >> L.r[i].key;
    }
    /*cout << "直接插入排序" << endl;
    InsertSort(L);*/


    /*cout << "希尔排序" << endl;
    cout << "请输入有几个增量选取" << endl;
    int t;
    int dt[10];
    cin >> t;
    cout << "请输入每一趟的值" << endl;
    for (int i = 0; i < t; i++){
        cin >> dt[i];
    }
    ShellSort(L, dt, t);*/

    /*cout << "冒泡排序" << endl;
    BubbleSort(L);*/



    /*cout << "选择排序" << endl;
    SelectSort(L);
    */

    /*cout << "快速排序" << endl;
    QuickSort(L);*/


    cout << "堆排序" << endl;
    HeapSort(L);

    for (int i = 1; i <= L.length; i++){
        cout << "第" << (i ) << "个值：" << L.r[i].key << endl;
    }

}