c/c++实现 多种排序

1.直接插入排序

void InsertSort(int a[],int n)
{
    int temp;
    int j;
    for (int i = 1; i < n; ++i)
    {
        temp = a[i];
        for (j = i - 1; j >= 0; --j)
        {
            if (a[j] <= temp)
                break;
            a[j + 1] = a[j];
        }
        a[j + 1] = temp;
    }
}

2.直接选择排序

//直接选择排序
void SectionSort(int a[], int n)
{
    int min;
    for (int i = 0; i < n - 1; ++i)
    {
        min = i;
        for (int j = i + 1; j < n; ++j)
            if (a[j] < a[min])
                min = j;
        if (min != i)
        {
            swap(a[i], a[min]);
        }
    }
}

3.希尔排序

//希尔排序
void ShellSort(int a[], int n)
{
    int d = n / 2;
    int j;
    int temp;
    while (d >= 1)
    {
        for (int i = d; i < n; ++i)
        {
            j = i - d;
            temp = a[i];
            while (j >= 0 && a[j] > temp)
            {
                a[j + d] = a[j];
                j = j - d;
            }
            a[j + d] = temp;
        }
        d = d / 2;
    }
}

4.快速排序

//快速排序
void QuickSort(int a[], int left, int right)
{
    int temp;
    if (left < right)
    {
        int i = left;
        int j = right;
        temp = a[i];
        do
        {
            while (i < j && a[j] > temp)
                --j;
            if (i < j)
                a[i++] = a[j];
            while (i < j && a[i] < temp)
                ++i;
            if (i < j)
                a[j--] = a[i];
        } while (i != j);
        a[i] = temp;
        QuickSort(a, left, i - 1);
        QuickSort(a, i + 1, right);
    }
}

5.二分排序

//二分排序
void BinarySort(int a[], int n)
{
    int left, right, mid;
    int temp;
    for (int i = 1; i < n; ++i)
    {
        left = 0;
        right = i - 1;
        temp = a[i];
        while (left <= right)
        {
            mid = (left + right) / 2;
            if (a[i] < a[mid])
                right = mid - 1;
            else
                left = mid + 1;
        }
        for (int j = i - 1; j >= left; --j)
            a[j + 1] = a[j];
        a[left] = temp;
    }
}

6.鸡尾酒排序

// 鸡尾酒排序
void CocktailSort(int a[], int n)
{
    int left = 0, right = n - 1;
    while (left < right)
    {
        for (int i = left; i < right; ++i)
        {
            if (a[i] > a[i + 1])
                swap(a[i], a[i + 1]);
        }
        --right;
        for (int j = right; j > left; --j)
        {
            if (a[j] < a[j - 1])
                swap(a[j], a[j - 1]);
        }
        ++left;
    }
}

7.冒泡排序

}
//冒泡排序
void BubbleSort(int a[], int n)
{
    bool flag;
    for (int i = 0; i < n - 1; ++i)
    {
        flag = true;
        for (int j = 0; j < n - 1 - i; ++j)
        {
            if (a[j] > a[j + 1])
            {
                swap(a[j], a[j + 1]);
            }
            flag = false;
        }
        if (flag)
            break;
    }
}

8.表插入排序

//表插入排序
struct Record
{
    int data;
    int next;
};
struct Table
{
    Record r[100];
    int length;
};
void InitTable(Table *t, int length)
{
    t->length = length;
    for (int i = 1; i <= length; ++i)
        cin >> t->r[i].data;
}
void TableSort(Table& t)
{
    int pre, current;
    t.r[0].next = 1;
    t.r[1].next = 0;
    for (int i = 2; i <= t.length; ++i)
    {
        pre = 0;
        current = t.r[0].next;
        while (current != 0 && t.r[current].data <= t.r[i].data)
        {
            pre = current;
            current = t.r[current].next;
        }
        t.r[i].next = current;
        t.r[pre].next = i;
    }
}

9.完整测试代码:

#include <iostream>

using namespace std;

//直接插入排序
void InsertSort(int a[],int n)
{
    int temp;
    int j;
    for (int i = 1; i < n; ++i)
    {
        temp = a[i];
        for (j = i - 1; j >= 0; --j)
        {
            if (a[j] <= temp)
                break;
            a[j + 1] = a[j];
        }
        a[j + 1] = temp;
    }
}
//直接选择排序
void SectionSort(int a[], int n)
{
    int min;
    for (int i = 0; i < n - 1; ++i)
    {
        min = i;
        for (int j = i + 1; j < n; ++j)
            if (a[j] < a[min])
                min = j;
        if (min != i)
        {
            swap(a[i], a[min]);
        }
    }
}
//希尔排序
void ShellSort(int a[], int n)
{
    int d = n / 2;
    int j;
    int temp;
    while (d >= 1)
    {
        for (int i = d; i < n; ++i)
        {
            j = i - d;
            temp = a[i];
            while (j >= 0 && a[j] > temp)
            {
                a[j + d] = a[j];
                j = j - d;
            }
            a[j + d] = temp;
        }
        d = d / 2;
    }
}
//快速排序
void QuickSort(int a[], int left, int right)
{
    int temp;
    if (left < right)
    {
        int i = left;
        int j = right;
        temp = a[i];
        do
        {
            while (i < j && a[j] > temp)
                --j;
            if (i < j)
                a[i++] = a[j];
            while (i < j && a[i] < temp)
                ++i;
            if (i < j)
                a[j--] = a[i];
        } while (i != j);
        a[i] = temp;
        QuickSort(a, left, i - 1);
        QuickSort(a, i + 1, right);
    }
}
//二分排序
void BinarySort(int a[], int n)
{
    int left, right, mid;
    int temp;
    for (int i = 1; i < n; ++i)
    {
        left = 0;
        right = i - 1;
        temp = a[i];
        while (left <= right)
        {
            mid = (left + right) / 2;
            if (a[i] < a[mid])
                right = mid - 1;
            else
                left = mid + 1;
        }
        for (int j = i - 1; j >= left; --j)
            a[j + 1] = a[j];
        a[left] = temp;
    }
}
// 鸡尾酒排序
void CocktailSort(int a[], int n)
{
    int left = 0, right = n - 1;
    while (left < right)
    {
        for (int i = left; i < right; ++i)
        {
            if (a[i] > a[i + 1])
                swap(a[i], a[i + 1]);
        }
        --right;
        for (int j = right; j > left; --j)
        {
            if (a[j] < a[j - 1])
                swap(a[j], a[j - 1]);
        }
        ++left;
    }
}
//冒泡排序
void BubbleSort(int a[], int n)
{
    bool flag;
    for (int i = 0; i < n - 1; ++i)
    {
        flag = true;
        for (int j = 0; j < n - 1 - i; ++j)
        {
            if (a[j] > a[j + 1])
            {
                swap(a[j], a[j + 1]);
            }
            flag = false;
        }
        if (flag)
            break;
    }
}
//表插入排序
struct Record
{
    int data;
    int next;
};
struct Table
{
    Record r[100];
    int length;
};
void InitTable(Table *t, int length)
{
    t->length = length;
    for (int i = 1; i <= length; ++i)
        cin >> t->r[i].data;
}
void TableSort(Table& t)
{
    int pre, current;
    t.r[0].next = 1;
    t.r[1].next = 0;
    for (int i = 2; i <= t.length; ++i)
    {
        pre = 0;
        current = t.r[0].next;
        while (current != 0 && t.r[current].data <= t.r[i].data)
        {
            pre = current;
            current = t.r[current].next;
        }
        t.r[i].next = current;
        t.r[pre].next = i;
    }
}
int main()
{
    int a[10] = { 9,4,2,1,0,5,7,6,3,8 };
    //InsertSort(a, 10);
    //SectionSort(a, 10);
    //ShellSort(a, 10);
    //QuickSort(a, 0, 9);
    //BinarySort(a, 10);
    //CocktailSort(a, 10);
    //BubbleSort(a, 10);
    /*for (int i = 0; i < 10; ++i)
        cout << a[i] << ends;*/
    Table t;
    InitTable(&t, 10);
    TableSort(t);
    int pos = 0;
    for (int i = 1; i <= t.length; ++i)
    {
        pos = t.r[pos].next;
        if (pos == 0)
            continue;
        cout << t.r[pos].data << endl;
    }
    system("pause");
    return 0;
}