diff --git a/归并排序.cpp b/归并排序.cpp
new file mode 100644
index 0000000..5fe3dbc
--- /dev/null
+++ b/归并排序.cpp
@@ -0,0 +1,28 @@
+#include<stdio.h>
+int n,num[100010],tmp[100010];
+void sort(int l,int r)
+{
+	if(l>=r)
+	    return;
+	int mid=(l+r)/2;
+	sort(l,mid);
+	sort(mid+1,r);
+	int k=0,i=l,j=mid+1;
+	while(i<=mid&&j<=r)
+	    if(num[i]<num[j]) tmp[k++]=num[i++];
+	    else tmp[k++]=num[j++];
+	while(i<=mid) tmp[k++]=num[i++];
+	while(j<=r) tmp[k++]=num[j++];
+	for(int i=l,j=0;i<=r;i++,j++)
+	    num[i]=tmp[j];
+}
+int main()
+{
+	scanf("%d",&n);
+	for(int i=0;i<n;i++)
+	    scanf("%d",&num[i]);
+	sort(0,n-1);
+	for(int i=0;i<n;i++)
+	    printf("%d ",num[i]);
+	return 0;
+}