feat: add solutions to lc problem: No.0912

No.0912.Sort an Array

Author: yanglbme

README.md

@@ -38,6 +38,7 @@
 -   [准时到达的列车最小时速](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README.md) - 二分查找
 -   [找到需要补充粉笔的学生编号](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README.md) - 二分查找
 -   [可移除字符的最大数目](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README.md) - 二分查找
+-   [排序数组](/solution/0900-0999/0912.Sort%20an%20Array/README.md) - 快速排序、归并排序
 <!-- 排序算法、待补充 -->
 
 ### 2. 搜索

README_EN.md

@@ -37,6 +37,7 @@ Complete solutions to [LeetCode](https://leetcode.com/problemset/all/), [LCOF](h
 -   [Minimum Speed to Arrive on Time](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README_EN.md) - Binary search
 -   [Find the Student that Will Replace the Chalk](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README_EN.md) - Binary search
 -   [Maximum Number of Removable Characters](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README_EN.md) - Binary search
+-   [Sort an Array](/solution/0900-0999/0912.Sort%20an%20Array/README_EN.md) - Quick Sort, Merge Sort
 
 ### 2. Search
 

basic/sorting/MergeSort/Main.cpp

@@ -1,74 +1,35 @@
 #include <iostream>
-#include <vector>
 
 using namespace std;
 
-void printvec( const vector<int> &vec, const string &strbegin = "", const string &strend = "" )
-{
-	cout << strbegin << endl;
-	for ( auto val : vec )
-	{
-		cout << val << "\t";
-	}
-
-	cout << endl;
-	cout << strend << endl;
-}
+const int N = 1e6 + 10;
 
+int n;
+int nums[N];
+int tmp[N];
 
-void mergesort( vector<int> & vec, int left, int right )
+void merge_sort(int nums[], int left, int right)
 {
-	if ( left >= right )
-	{
-		return;
-	}
-
-	int mid = left + (right - left) / 2;
-	mergesort( vec, left, mid );
-	mergesort( vec, mid + 1, right );
-
-	int i = left;
-	int j = mid + 1;
-	int k = 0;
-	vector<int>	vecTmp;
-	while ( i <= mid && j <= right )
-	{
-		if ( vec[i] < vec[j] )
-		{
-			vecTmp.push_back( vec[i] );
-			i++;
-		}else  {
-			vecTmp.push_back( vec[j] );
-			j++;
-		}
-	}
-
-	while ( i <= mid )
-	{
-		vecTmp.push_back( vec[i] );
-		i++;
-	}
-
-	while ( j <= right )
-	{
-		vecTmp.push_back( vec[j] );
-		j++;
-	}
-
-	for ( int i = left; i <= right; i++ )
-	{
-		vec[i] = vecTmp[i - left];
-	}
-
-	return;
+    if (left >= right) return;
+    int mid = (left + right) >> 1;
+    merge_sort(nums, left, mid);
+    merge_sort(nums, mid + 1, right);
+    int i = left, j = mid + 1, k = 0;
+    while (i <= mid && j <= right)
+    {
+        if (nums[i] <= nums[j]) tmp[k++] = nums[i++];
+        else tmp[k++] = nums[j++];
+    }
+    while (i <= mid) tmp[k++] = nums[i++];
+    while (j <= right) tmp[k++] = nums[j++];
+    for (i = left, j = 0; i <= right; ++i, ++j) nums[i] = tmp[j];
 }
 
-
-int main( void )
+int main()
 {
-	vector<int> vec = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
-	printvec( vec );
-	mergesort( vec, 0, vec.size() - 1 );
-	printvec( vec, "after insert sort" );
-	return(0);
-}
+    int n;
+    scanf("%d", &n);
+    for (int i = 0; i < n; ++i) scanf("%d", &nums[i]);
+    merge_sort(nums, 0, n - 1);
+    for (int i = 0; i < n; ++i) printf("%d ", nums[i]);
+}

basic/sorting/MergeSort/Main.java

@@ -11,16 +11,16 @@ public static void main(String[] args) {
             nums[i] = sc.nextInt();
         }
         mergeSort(nums, 0, n - 1);
-        for (int i = 0; i < n; ++i) {
-            System.out.printf("%d ", nums[i]);
+        for (int x : nums) {
+            System.out.print(x + " ");
         }
     }
 
     public static void mergeSort(int[] nums, int left, int right) {
         if (left >= right) {
             return;
         }
-        int mid = (left + right) >>> 1;
+        int mid = (left + right) >> 1;
         mergeSort(nums, left, mid);
         mergeSort(nums, mid + 1, right);
         int i = left, j = mid + 1, k = 0;
@@ -30,6 +30,7 @@ public static void mergeSort(int[] nums, int left, int right) {
             } else {
                 tmp[k++] = nums[j++];
             }
+            
         }
         while (i <= mid) {
             tmp[k++] = nums[i++];

basic/sorting/MergeSort/README.md

@@ -276,78 +276,39 @@ func main() {
 
 ```cpp
 #include <iostream>
-#include <vector>
 
 using namespace std;
 
-void printvec( const vector<int> &vec, const string &strbegin = "", const string &strend = "" )
-{
-    cout << strbegin << endl;
-    for ( auto val : vec )
-    {
-        cout << val << "\t";
-    }
+const int N = 1e6 + 10;
 
-    cout << endl;
-    cout << strend << endl;
-}
+int n;
+int nums[N];
+int tmp[N];
 
-
-void mergesort( vector<int> & vec, int left, int right )
+void merge_sort(int nums[], int left, int right)
 {
-    if ( left >= right )
-    {
-        return;
-    }
-
-    int mid = left + (right - left) / 2;
-    mergesort( vec, left, mid );
-    mergesort( vec, mid + 1, right );
-
-    int i = left;
-    int j = mid + 1;
-    int k = 0;
-    vector<int>	vecTmp;
-    while ( i <= mid && j <= right )
-    {
-        if ( vec[i] < vec[j] )
-        {
-            vecTmp.push_back( vec[i] );
-            i++;
-        }else  {
-            vecTmp.push_back( vec[j] );
-            j++;
-        }
-    }
-
-    while ( i <= mid )
-    {
-        vecTmp.push_back( vec[i] );
-        i++;
-    }
-
-    while ( j <= right )
-    {
-        vecTmp.push_back( vec[j] );
-        j++;
-    }
-
-    for ( int i = left; i <= right; i++ )
+    if (left >= right) return;
+    int mid = (left + right) >> 1;
+    merge_sort(nums, left, mid);
+    merge_sort(nums, mid + 1, right);
+    int i = left, j = mid + 1, k = 0;
+    while (i <= mid && j <= right)
     {
-        vec[i] = vecTmp[i - left];
+        if (nums[i] <= nums[j]) tmp[k++] = nums[i++];
+        else tmp[k++] = nums[j++];
     }
-
-    return;
+    while (i <= mid) tmp[k++] = nums[i++];
+    while (j <= right) tmp[k++] = nums[j++];
+    for (i = left, j = 0; i <= right; ++i, ++j) nums[i] = tmp[j];
 }
 
-
-int main( void )
+int main()
 {
-    vector<int> vec = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
-    printvec( vec );
-    mergesort( vec, 0, vec.size() - 1 );
-    printvec( vec, "after insert sort" );
-    return(0);
+    int n;
+    scanf("%d", &n);
+    for (int i = 0; i < n; ++i) scanf("%d", &nums[i]);
+    merge_sort(nums, 0, n - 1);
+    for (int i = 0; i < n; ++i) printf("%d ", nums[i]);
 }
 ```
 

solution/0900-0999/0912.Sort an Array/README.md

@@ -40,8 +40,11 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
--   快速排序
--   归并排序
+**方法一：快速排序**
+
+**方法二：归并排序**
+
+以上两种方法时间复杂度均为 O(nlogn)。
 
 <!-- tabs:start -->
 
@@ -320,6 +323,79 @@ func mergeSort(nums []int, left, right int) {
 }
 ```
 
+### **JavaScript**
+
+快速排序：
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var sortArray = function (nums) {
+    function quickSort(left, right) {
+        if (left >= right) {
+            return;
+        }
+        let i = left - 1;
+        let j = right + 1;
+        const x = nums[(left + right) >> 1];
+        while (i < j) {
+            while (nums[++i] < x);
+            while (nums[--j] > x);
+            if (i < j) {
+                [nums[i], nums[j]] = [nums[j], nums[i]];
+            }
+        }
+        quickSort(left, j);
+        quickSort(j + 1, right);
+    }
+    const n = nums.length;
+    quickSort(0, n - 1);
+    return nums;
+};
+```
+
+归并排序：
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var sortArray = function (nums) {
+    function mergetSort(left, right) {
+        if (left >= right) {
+            return;
+        }
+        const mid = (left + right) >> 1;
+        mergetSort(left, mid);
+        mergetSort(mid + 1, right);
+        let [i, j, k] = [left, mid + 1, 0];
+        while (i <= mid && j <= right) {
+            if (nums[i] <= nums[j]) {
+                tmp[k++] = nums[i++];
+            } else {
+                tmp[k++] = nums[j++];
+            }
+        }
+        while (i <= mid) {
+            tmp[k++] = nums[i++];
+        }
+        while (j <= right) {
+            tmp[k++] = nums[j++];
+        }
+        for (i = left, j = 0; i <= right; ++i, ++j) {
+            nums[i] = tmp[j];
+        }
+    }
+    const n = nums.length;
+    let tmp = new Array(n).fill(0);
+    mergetSort(0, n - 1);
+    return nums;
+};
+```
+
 ### **...**
 
 ```