用C++实现各种排序算法

用C++实现数据结构各种排序算法。

一、插入排序

//直接插入排序
void insertSort(int a[], int len) {
    for (int i = 1; i < len; i++) {
        if (a[i - 1] > a[i]) {
            int k = a[i], j;
            for (j = i; j > 0 && a[j - 1] > k; j--) {
                a[j] = a[j - 1];
            }
            a[j] = k;
        }
    }
}


//折半插入排序
void insertSortPlus(int a[], int len) {
    for (int i = 1; i < len; i++) {
        if (a[i - 1] > a[i]) {
            int mid, low = 0, high = i - 1, k = a[i];
            while (low <= high) {
                mid = (low + high) / 2;
                if (k < a[mid]) {
                    high = mid - 1;
                } else {
                    low = mid + 1;
                }
            }
            for (int j = i; j > low; j--) {
                a[j] = a[j - 1];
            }
            a[low] = k;
        }
    }
}


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

二、交换排序

void swapPlus(int a[], int i, int j) {
    int temp = a[i];
    a[i] = a[j];
    a[j] = temp;
}


//冒泡排序
void bubbleSort(int a[], int len) {
    for (int i = 0; i < len - 1; i++) {
        int flag = 0;
        for (int j = len - 1; j > i; j--) {
            if (a[j - 1] > a[j]) {
                flag = 1;
                swapPlus(a, j - 1, j);
            }
        }
        if (!flag)
            break;
    }
}

//快排划分
int partion(int a[], int low, int high) {
    int pivot = a[low];
    while (low < high) {
        if (a[high] >= pivot && low < high)
            --high;
        a[low] = a[high];
        if (a[low] <= pivot && low < high)
            ++low;
        a[high] = a[low];
    }
    a[low] = pivot;
    return low;
}

//快速排序
void quicklySort(int a[], int low, int high) {
    if (low < high) {
        int pivot = partion(a, low, high);
        quicklySort(a, low, pivot - 1);
        quicklySort(a, pivot + 1, high);
    }
}

三、选择排序

void swapPlus(int a[], int i, int j) {
    int temp = a[i];
    a[i] = a[j];
    a[j] = temp;
}


//选择排序
void selectSort(int a[], int len) {
    for (int i = 0; i < len - 1; i++) {
        int min = i;
        for (int j = len - 1; j > i; j--) {
            if (a[j] < a[min]) {
                min = j;
            }
        }
        if (min != i)
            swapPlus(a, i, min);
    }
}

void adjustHeap(int a[], int k, int len) {
    int s = a[k];
    for (int i = 2 * k; i <= len; i = 2 * i) {
        if (i < len && a[i + 1] < a[i])
            i++;
        if (s <= a[i])
            break;
        else {
            a[k] = a[i];
            k = i;
        }
    }
    a[k] = s;
}

void buildHeap(int a[], int len) {
    for (int i = len / 2; i >= 0; i--) {
        adjustHeap(a, i, len);
    }
}

//堆排序
void heapSort(int a[], int len) {
    buildHeap(a, len);
    for (int i = len; i > 0; i--) {
        swapPlus(a, 0, i);
        adjustHeap(a, 0, i - 1);
    }
}

四、归并排序

void mergee(int a[], int low, int mid, int high, int len) {
    int *b = new int[len];
    int i, j, k;
    for (k = low; k <= high; k++) {
        b[k] = a[k];
    }
    for (i = low, j = mid + 1, k = i; i <= mid && j <= high; k++) {
        if (b[i] <= b[j]) {
            a[k] = b[i++];
        } else {
            a[k] = b[j++];
        }
    }
    while (i <= mid)
        a[k++] = b[i++];
    while (j <= high)
        a[k++] = b[j++];
}

//归并排序
void mergeSort(int a[], int low, int high, int len) {
    if (low < high) {
        int mid = (low + high) / 2;
        mergeSort(a, low, mid, len);
        mergeSort(a, mid + 1, high, len);
        mergee(a, low, mid, high, len);
    }
}

五、完整测试代码

#include <iostream>

using namespace std;

void swapPlus(int a[], int i, int j) {
    int temp = a[i];
    a[i] = a[j];
    a[j] = temp;
}

//选择排序
void selectSort(int a[], int len) {
    for (int i = 0; i < len - 1; i++) {
        int min = i;
        for (int j = len - 1; j > i; j--) {
            if (a[j] < a[min]) {
                min = j;
            }
        }
        if (min != i)
            swapPlus(a, i, min);
    }
}

void adjustHeap(int a[], int k, int len) {
    int s = a[k];
    for (int i = 2 * k; i <= len; i = 2 * i) {
        if (i < len && a[i + 1] < a[i])
            i++;
        if (s <= a[i])
            break;
        else {
            a[k] = a[i];
            k = i;
        }
    }
    a[k] = s;
}

void buildHeap(int a[], int len) {
    for (int i = len / 2; i >= 0; i--) {
        adjustHeap(a, i, len);
    }
}

//堆排序
void heapSort(int a[], int len) {
    buildHeap(a, len);
    for (int i = len; i > 0; i--) {
        swapPlus(a, 0, i);
        adjustHeap(a, 0, i - 1);
    }
}


//冒泡排序
void bubbleSort(int a[], int len) {
    for (int i = 0; i < len - 1; i++) {
        int flag = 0;
        for (int j = len - 1; j > i; j--) {
            if (a[j - 1] > a[j]) {
                flag = 1;
                swapPlus(a, j - 1, j);
            }
        }
        if (!flag)
            break;
    }
}

int partion(int a[], int low, int high) {
    int pivot = a[low];
    while (low < high) {
        if (a[high] >= pivot && low < high)
            --high;
        a[low] = a[high];
        if (a[low] <= pivot && low < high)
            ++low;
        a[high] = a[low];
    }
    a[low] = pivot;
    return low;
}

//快速排序
void quicklySort(int a[], int low, int high) {
    if (low < high) {
        int pivot = partion(a, low, high);
        quicklySort(a, low, pivot - 1);
        quicklySort(a, pivot + 1, high);
    }
}

//直接插入排序
void insertSort(int a[], int len) {
    for (int i = 1; i < len; i++) {
        if (a[i - 1] > a[i]) {
            int k = a[i], j;
            for (j = i; j > 0 && a[j - 1] > k; j--) {
                a[j] = a[j - 1];
            }
            a[j] = k;
        }
    }
}

//折半插入排序
void insertSortPlus(int a[], int len) {
    for (int i = 1; i < len; i++) {
        if (a[i - 1] > a[i]) {
            int mid, low = 0, high = i - 1, k = a[i];
            while (low <= high) {
                mid = (low + high) / 2;
                if (k < a[mid]) {
                    high = mid - 1;
                } else {
                    low = mid + 1;
                }
            }
            for (int j = i; j > low; j--) {
                a[j] = a[j - 1];
            }
            a[low] = k;
        }
    }
}

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


void mergee(int a[], int low, int mid, int high, int len) {
    int *b = new int[len];
    int i, j, k;
    for (k = low; k <= high; k++) {
        b[k] = a[k];
    }
    for (i = low, j = mid + 1, k = i; i <= mid && j <= high; k++) {
        if (b[i] <= b[j]) {
            a[k] = b[i++];
        } else {
            a[k] = b[j++];
        }
    }
    while (i <= mid)
        a[k++] = b[i++];
    while (j <= high)
        a[k++] = b[j++];
}

//归并排序
void mergeSort(int a[], int low, int high, int len) {
    if (low < high) {
        int mid = (low + high) / 2;
        mergeSort(a, low, mid, len);
        mergeSort(a, mid + 1, high, len);
        mergee(a, low, mid, high, len);
    }
}


//测试用例：
//9
//12 53 83 22 18 94 25 62 19
int main() {
    int n;
    cin >> n;
    int *nums = new int[n];
    for (int i = 0; i < n; i++) {
        cin >> nums[i];
    }
//    quicklySort(nums, 0, n - 1);
//    selectSort(nums, n);
//    heapSort(nums, n - 1);
//    bubbleSort(nums,n);
//    insertSort(nums, n);
//    insertSortPlus(nums, n);
//    mergeSort(nums, 0, n - 1, n);
    shellSort(nums, n);
    cout << "result:";
    for (int i = 0; i < n; i++) {
        cout << nums[i] << ' ';
    }
    return 0;
}