Merge pull request #1 from 2936170194/main

Merge Sort add by Jie Li

C++数据结构的可能实现/Merge Sort

@@ -0,0 +1,67 @@
+
+#include <iostream>
+using namespace std;
+
+const int N = 1e6 + 10;
+
+int q[N], tmp[N];
+
+int n;
+
+void MergeSort(int q[], int l, int r)
+{
+	if (l >= r)
+	{
+		return;
+	}
+
+	int mid = l + r >> 1;
+	MergeSort(q, l, mid);
+	MergeSort(q, mid + 1, r);
+	int i = l;
+	int j = mid + 1;
+	int k = 0;
+	while (i <= mid && j <= r)
+	{
+		if (q[i] <= q[j])
+		{
+			tmp[k++] = q[i++];
+		}
+		else
+		{
+			tmp[k++] = q[j++];
+		}
+	}
+
+	while (i <= mid)
+	{
+		tmp[k++] = q[i++];
+	}
+	while (j <= r)
+	{
+		tmp[k++] = q[j++];
+	}
+
+	for (int i = l, j = 0; i <= r; i++)
+	{
+		q[i] = tmp[j++];
+	}
+}
+
+int main()
+{
+	cin >> n;
+	for (int i = 0; i < n; i++)
+	{
+		cin >> q[i];
+	}
+
+	MergeSort(q, 0, n - 1);
+
+	for (int i = 0; i < n; i++)
+	{
+		cout << q[i] << ' ';
+	}
+
+	return 0;
+}