C++-快速排序[STL][快速排序][并归排序][堆排序]

#include <queue>
#include <iostream>
using namespace std;
priority_queue<int>q;
int main(){
    for(int a;cin>>a;q.push(-a))
        if(a==0){
            for(;!q.empty();q.pop())cout<<-q.top()<<" ";
            return 0;
        }
} 

#include <iostream>
using namespace std;
const int N=1e6+20;
int a[N],n;
void sort(int a[],int l,int r){
    if(l>r)return;
    int L=l,R=r,key=a[l];
    while(L<R){
        while(L<R&&a[R]>=key)R--;a[L]=a[R];
        while(L<R&&a[L]<=key)L++;a[R]=a[L];
    }
    a[L]=key;
    sort(a,l,L-1);
    sort(a,L+1,r);
}
int main(){
    for(int i;cin>>i;a[++n]=i)if(i==0)break;
    sort(a,1,n);
    for(int i=1;i<=n;i++)cout<<a[i]<<" ";
    return 0;
}

#include <iostream>
using namespace std;
const int N=1e6+20;
int a[N],n,t[N];
void merge(int a[],int L,int R){
    if(L>=R)return;
    int M=(L+R)>>1;
    merge(a,L,M);
    merge(a,M+1,R);
    if(a[M]<=a[M+1])return;//优化 
    int l=L,r=M+1,n=0;
    while(l<=M&&r<=R)t[++n]=a[l]<=a[r]?a[l++]:a[r++];
    while(l<=M)t[++n]=a[l++];
    while(r<=R)t[++n]=a[r++];
    for(int i=L,j=1;i<=R;a[i++]=t[j++]);
}
int main(){
    for(int i;cin>>i;a[++n]=i)if(i==0)break;
    merge(a,1,n);
    for(int i=1;i<=n;i++)cout<<a[i]<<" ";
    return 0;
}

#include <iostream>
using namespace std;
const int N=1e7+10;
struct heap{
    int a[N],n;    
    int top(){return a[1];}
    bool empty(){return n==0;}
    void push(int x){a[++n]=x,up(n);}
    void pop(){swap(a[1],a[n--]),down(1);}
    void up(int x){
        for(int f;x>1,f=x>>1;x=f){
            if(a[f]>a[x])swap(a[f],a[x]);
            else return;
        }
    }
    void down(int x){
        for(int ls,rs,p;(x<<1)<=n;x=p){
            ls=x<<1,rs=x<<1|1;
            p=rs<=n&&a[rs]<a[ls]?rs:ls;
            if(a[p]<a[x])swap(a[p],a[x]);
            else return;
        }
    }
};
heap q;
int main(){
    for(int a;cin>>a;q.push(a))if(a==0)break;
    while(!q.empty())cout<<q.top()<<" ",q.pop();cout<<endl;
    return 0;
}