Merge与Mergesort
代码:
#include<iostream>
using namespace std;
//合并排序
int Mergesort(int a[],int left,int right);
void Merge(int a[],int left,int mid,int right);
int main()
{
int n;
cin>>n;
int *a=new int[n];
for(int i=0;i<n
Merge与Mergesort
代码:
#include<iostream>
using namespace std;
//合并排序
int Mergesort(int a[],int left,int right);
void Merge(int a[],int left,int mid,int right);
int main()
{
int n;
cin>>n;
int *a=new int[n];
for(int i=0;i<n