快排和归并排序

#include<stdio.h>
#include<iostream>
#include<cstring>
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<bits/stdc++.h>
using namespace std;
int b[50],a[50];
//快排
void quiksort(int a[],int left,int right)
{
    int i=left,j=right;
    int temp=a[left];
    if(left>=right)
        return;
    while(i<j)
    {
        while(i<j&&a[j]>=temp)j--;
        a[i]=a[j];
        while(i<j&&a[i]<=temp)i++;
        a[j]=a[i];
    }
    a[i]=temp;
    quiksort(a,left,i-1);
    quiksort(a,i+1,right);
}


//归并排序
void Merge(int a[],int left,int mid,int right,int temp[])
{
    int i=left,j=mid+1;
    int k=0;
    while(i<=mid&&j<=right)
    {
        if(a[i]<=a[j])
            temp[k++]=a[i++];
        else temp[k++]=a[j++];
    }
    while(i<=mid)
    {
        temp[k++]=a[i++];
    }
    while(j<=right)
    {
        temp[k++]=a[j++];
    }
    int  t=0;
    for(int i=left;i<=right;i++)
        a[i]=temp[t++];
}
void Sort(int a[],int left,int right,int temp[])
{
    if(left<right)
    {
        int mid=(left+right)/2;
        Sort(a,left,mid,temp);
        Sort(a,mid+1,right,temp);
        Merge(a,left,mid,right,temp);
    }
}

int main()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>a[i];
    //quiksort(a,0,n-1);
    Sort(a,0,n-1,b);
    for(int i=0;i<n;i++)
        cout<<a[i]<<' ';

}