【排序】七大排序代码实现

最新推荐文章于 2024-10-10 22:59:02 发布

敲击石头的一百零一次

最新推荐文章于 2024-10-10 22:59:02 发布

阅读量197

点赞数 2

分类专栏： ds 文章标签：算法 java 数据结构

本文链接：https://blog.csdn.net/2202_75999061/article/details/142032307

版权

ds 专栏收录该内容

83 篇文章 0 订阅

订阅专栏

一、题目

. - 力扣（LeetCode）

二、题解

class Solution {
public:
    void qsort(vector<int>& arr, int l, int r) {
        if (l >= r) return;
        srand(time(0));
        int i = l, s = l - 1, e = r + 1, x = arr[rand() % (r - l + 1) + l];
        while (i < e)
            if (arr[i] > x) swap(arr[i], arr[--e]);
            else if (arr[i] < x) swap(arr[i++], arr[++s]);
            else i++;
        qsort(arr, l, s), qsort(arr, e, r);
    }

    void insert_sort(vector<int>& arr) {
        int n = arr.size();
        for (int i = 1; i < n; i++) {
            int j = i - 1, t = arr[i];
            for (; j >= 0; j--)
                if (arr[j] > t) arr[j + 1] = arr[j];
                else break;
            arr[j + 1] = t;
        }
    }

    void shell_sort(vector<int>& arr) {
        int gaps[3] = {2, 1};
        for (auto gap : gaps) {
            for (int i = gap; i < arr.size(); i++) {
                int t = arr[i], j = i - gap;
                for (; j >= 0; j-= gap)
                    if (arr[j] > t) arr[j + gap] = arr[j];
                    else break;
                arr[j + gap] = t; 
            }
        }
    }

    void select_sort(vector<int>& arr) {
        for (int i = 0; i < arr.size() - 1; i++) {
            int t = i;
            for (int j = t + 1; j < arr.size(); j++)
                if (arr[j] < arr[t]) t = j;
            swap(arr[i], arr[t]);
        }
    }

    void bubble_soer(vector<int>& arr) {
        for (int i = 0; i < arr.size(); i++)
            for (int j = 0; j < arr.size() - i - 1; j++)
                if (arr[j + 1] < arr[j])
                    swap(arr[j + 1], arr[j]);
    }

    void sift_down(vector<int>& arr, int parent, int n) {
        int child = 2 * parent + 1;
        while (child < n) {
            if (child + 1  < n && arr[child + 1] > arr[child]) child++;
            if (arr[child] > arr[parent]) {
                swap(arr[parent], arr[child]);

                parent = child;
                child = parent * 2 + 1;
            } else break;
        }
    }

    void heap_sort(vector<int>& arr) {
        for (int parent = (arr.size() - 1 - 1) / 2; parent >= 0; parent--)
            sift_down(arr, parent, arr.size());
        
        int n = arr.size();
        while (n) {
            swap(arr[0], arr[n - 1]);
            n--;
            sift_down(arr, 0, n);
        }
    }

    void merge_sort(vector<int>& arr, int l, int r) {
        if (l >= r) return;

        int mid = (l + r) / 2;
        merge_sort(arr, l, mid), merge_sort(arr, mid + 1, r);

        vector<int> tmp;
        int s1 = l, e1 = mid, s2 = mid + 1, e2 = r;
        while (s1 <= e1 && s2 <= e2) {
            if (arr[s1] < arr[s2]) 
                tmp.push_back(arr[s1++]);
            else 
                tmp.push_back(arr[s2++]);
        }

        while (s1 <= e1) tmp.push_back(arr[s1++]);
        while (s2 <= e2) tmp.push_back(arr[s2++]);

        for (int i = 0; i < tmp.size(); i++)
            arr[i + l] = tmp[i]; 
    }   

    vector<int> sortArray(vector<int>& nums) {
        // qsort(nums, 0, nums.size() - 1);
        // insert_sort(nums);
        // shell_sort(nums);
        // select_sort(nums);
        // bubble_soer(nums);
        // heap_sort(nums);
        merge_sort(nums, 0, nums.size() - 1);
        return nums;
    }
};