几种简单的排序

几种简单的排序不多做介绍

#include<iostream>
#include<ctime>
using namespace std;
const int N = 100010;
void select_sort(int a[],int len){
    for (int i = 1; i < len;++i){
        int min = i;
        for (int j = i+1; j <= len;++j){
            if(a[min]>a[j]){
                min = j;
            }
        }
        swap(a[min],a[i]);
    }
}
void bub_sort(int a[],int len){
    for (int i = 1; i < len;++i){
        for (int j = 1; j <= len - i;++j){
            if(a[j]>a[j+1]){
                swap(a[j], a[j + 1]);
            }
        }
    }
}
void insert_sort(int a[],int len){
    for (int i = 2; i <= len;++i){
        for (int j = i; j>1;--j){
            if(a[j]<a[j-1]){
                swap(a[j], a[j - 1]);
            }
        }
    }
}
void merge_sort(int a[],int left,int right){
    if(right<=left){
        return;
    }
    int mid = (left + right) / 2;
    merge_sort(a, left, mid), merge_sort(a, mid+1, right);//先分后并
    int temp[N];
    int l = left, r = mid+1,t1=left;//t1当前数在临时数组内的位置
    while(l<=mid&&r<=right){
        if(a[l]>a[r]){
            temp[t1++] = a[r++];
        }
        else{
            temp[t1++] = a[l++];
        }
    }
    while (l <= mid){
        temp[t1++] = a[l++];
    }
    while (r <= right){
        temp[t1++] = a[r++];
    }
    for (int i = left; i <= right; ++i){
        a[i] = temp[i];
       // cout << a[i] << " ";//每一次的循环改变的数
    }
}
void quick_sort(int a[],int left,int right){//快速排序从左右开始查数
    if(right<=left){
        return;
    }
    srand((unsigned long long) time(NULL));//根据时间播种
    int t1 = rand() % (right - left) + left + 1;//随机选择一个数
    swap(a[t1], a[left]);
    int temp = a[left],l=left,r=right;
    while(l!=r){
        while(a[r]>=temp&&r>l){//先减确定l==r时a[r]<=a[left]
            --r;
        }
        while(a[l]<=temp&&l<r){
            ++l;
        }
        swap(a[l], a[r]);//此时a[l]>temp a[r]<temp 交换位置 也有可能是l==r
    }
    swap(a[l], a[left]);
    quick_sort(a, left, l-1);
    quick_sort(a, l+1, right);//可以保证l后面的数比a[l]大  l前面的数比a[l]小
}
void dui_sort(int a[],int len){//在线处理先预处理
    for (int j = len / 2; j;--j){//必须满足父亲比两个儿子小
        int i = j;
        while(i*2<=len){
            int t1 = i;
            if(a[t1]>a[i*2]){
                t1 = i * 2;
            }
            if(a[t1]>a[i*2+1]&&i*2+1<=len){
                t1 = i * 2 + 1;
            }
            if(i!=t1){
                swap(a[i], a[t1]);
                i = t1;
            }
            else
                break;
        }
    }
    while(len){
        cout << a[1]<<" ";
        swap(a[1], a[len--]);
        int i = 1;
        while(i*2<=len){
            int t1 = i;
            if(a[t1]>a[i*2]){
                t1 = i * 2;
            }
            if(a[t1]>a[i*2+1]&&i*2+1<=len){
                t1 = i * 2 + 1;
            }
            if(i!=t1){
                swap(a[i], a[t1]);
                i = t1;
            }
            else
                break;
        }
    }
    cout << endl;
}
void shell_sort(int a[], int len) {//从比较长的分量开始依次减小分量
    int fl = len;
    while(fl>1){
        fl = fl/3+1;
        for (int i = fl+1; i <= len;++i){
            if(a[i]<a[i-fl]){
                swap(a[i], a[i - fl]);
            }
        }
    }
}
int main(){
    int n,a[N];
    cin >> n;
    for (int i = 1;i<=n;++i){
        cin >> a[i];
    }
    select_sort(a,n);//O(n^2) 
    //bub_sort(a, n);//O(n^2)
    //insert_sort(a, n);//O(n^2)
    //merge_sort(a, 1, n);//O(nlogn)
    //quick_sort(a, 1, n);//o(n^2)最坏
    //dui_sort(a, n);//O(nlog(n))
    //shell_sort(a,n);//O(n^2)最坏
    for (int i = 1; i <= n;++i){
        cout << a[i] << " ";
    }
    return 0;
}