From 2ac4910cf166c056eb86ecb17e8c87ac3b9c15ac Mon Sep 17 00:00:00 2001
From: pevbyplqf <365069475@qq.com>
Date: Sat, 19 Feb 2022 14:06:58 +0800
Subject: [PATCH] =?UTF-8?q?Add=20=E5=BD=92=E5=B9=B6=E6=8E=92=E5=BA=8F?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 归并排序 | 66 ++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 66 insertions(+)
 create mode 100644 归并排序

diff --git a/归并排序 b/归并排序
new file mode 100644
index 0000000..dedb4d5
--- /dev/null
+++ b/归并排序
@@ -0,0 +1,66 @@
+//归并排序
+void copyArray(int source[], int dest[],int len,int first)  
+{  
+    int i;  
+    int j=first;  
+    for(i=0;i<len;i++)  
+    {  
+        dest[j] = source[i];  
+        j++;  
+    }  
+          
+} 
+//相邻两个有序子序列的归并函数，将a[low...mid]和a[mid+1...high]归并到T[LOW..high]中 
+void merge(int a[],int left,int right)  
+{  
+    int begin1 = left;  
+    int mid = (left+right)/2 ;  
+    int begin2 = mid+1;  
+    int k=0;  
+    int newArrayLen = right-left+1;  
+    int *b = (int*)malloc(newArrayLen*sizeof(int));  
+    while(begin1<=mid && begin2<=right)  
+    {  
+        if(a[begin1]<=a[begin2])  
+            b[k++] = a[begin1++];  
+        else  
+            b[k++] = a[begin2++];  
+    }  
+    while(begin1<=mid)  
+        b[k++] = a[begin1++];  
+    while(begin2<=right)  
+        b[k++] = a[begin2++];  
+    copyArray(b,a,newArrayLen,left);  
+    free(b);  
+}  
+//归并函数,将a[low...high]归并到T[low...high]中
+void mergeSort(int a[],int left,int right)  
+{  
+    int i;  
+    // 保证至少有两个元素  
+    if(left < right)  
+    {  
+        i = (left+right)/2;  
+        mergeSort(a,left,i);  
+        mergeSort(a,i+1,right);  
+        merge(a,left,right);  
+    }  
+} 
+void MergeSort(int a[],int n)
+{
+	mergeSort(a,0,n-1);
+}
+int main()
+{
+	int n;
+	cin>>n;
+	int *a=new int[n];
+	
+	for(int j=0;j<n;j++)
+		cin>>a[j];
+	MergeSort(a,n);
+	for(int i=0;i<n;i++)
+		cout<<a[i];
+	delete []a;
+	
+}
\ No newline at end of file