Quick sort & merge sort

Quick sort

#include<iostream>
#define MAXSIZE 10005
using namespace std; 
int a[MAXSIZE];
// Partition operation  
int paritition(int a[],int low,int high){
    
	int pivot=a[low];
	while(low<high){
    
		// From right to left  pivot  Small value 
		while(low<high&&a[high]>=pivot)	--high;
		a[low]=a[high];
		// From left to right  pivot  Big value  
		while(low<high&&a[low]<=pivot)	++low;
		a[high]=a[low];
	}
	// Reference value partition  
	a[low]=pivot;
	// return  pivot  The location of , As a boundary  
	return low;
}
void Quicksort(int a[],int low,int high){
    
	if(low<high){
    
		int pivot=paritition(a,low,high);
		Quicksort(a,low,pivot-1);
		Quicksort(a,pivot+1,high);
	}
}
int main(){
    
	int N,i;
	cin>>N;
	for(i=0;i<N;i++)
		cin>>a[i];
	Quicksort(a,0,N-1);
	//for(i=0;i<N;i++)
		cout<<a[i/2]<<endl;
}

Merge sort

#include<iostream>
#define MAXSIZE 100
using namespace std;

/* Will array  a  Two consecutive ordered sequences of ：  The first  s  To the first  m  Elements ,  The first  m+1  To the first  t  Elements ,  Merge to produce a  s  To the first  t  An ordered sequence of elements ： */
void Merge(int a[],int s,int m,int t){
    
	int temp[MAXSIZE];
	// i、j  The starting position of two consecutive ordered sequences  
	int i=s;
	int j=m+1;
	// k  Temporary array  temp  The subscript  
	int k=i;
	// Take the smallest one from the two ordered sequences and put it into the temporary array  
	while(i<=m&&j<=t)
		if(a[i]<=a[j])
			temp[k++]=a[i++];
		else 
			temp[k++]=a[j++];
	// The rest is put into the temporary array in turn , In fact, only one of them will be executed  while 
	while(i<=m)
		temp[k++]=a[i++];
	while(j<=t)
		temp[k++]=a[j++];
	// Copy the contents of the temporary array back to the original array  
	for(i=s;i<=t;i++)
		a[i]=temp[i]; 
}
/* decompose ：  hold  n  A sequence of elements is decomposed into a sequence with a length of  1  An ordered subsequence of  */ 
void Mergesort(int a[],int s,int t){
    
	// Split into length  1  The ordered sub table of  
	if(s==t)	return;
	int m=(t+s)/2;
	// Recursion on the left sequence  
	Mergesort(a,s,m);
	// Recursion of the sequence on the right  
	Mergesort(a,m+1,t);
	// Merge  
	Merge(a,s,m,t);
}
int main(){
    
	int N,a[MAXSIZE];
	cin>>N;
	for(int i=0;i<N;i++)
		cin>>a[i];
	Mergesort(a,0,N-1);
	for(int i=0;i<N;i++)
		cout<<a[i]<<endl;
}