feat: update quickSort in cpp

Author: yanglbme

basic/sorting/QuickSort/Main.cpp

@@ -1,80 +1,32 @@
 #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;
-}
-
-
-int partition( vector<int> & vec, int left, int right )
-{
-	if ( left >= right )
-	{
-		return left;
-	}
-
-	int base = vec[left];
-	while ( left < right )
-	{
-		while ( left < right && vec[right] >= base )
-		{
-			right--;
-		}
-		if ( left >= right )
-		{
-			break;
-		}
-
-		vec[left] = vec[right];
-
-		while ( left < right && vec[left] <= base )
-		{
-			left++;
-		}
 
-		if ( left >= right )
-		{
-			break;
-		}
+const int N = 1e6 + 10;
 
-		vec[right] = vec[left];
-	}
+int n;
+int nums[N];
 
-	vec[left] = base;
-	return left;
-}
-
-
-void quicksort( vector<int> & vec, int left, int right )
+void quick_sort(int nums[], int left, int right)
 {
-	if ( left >= right )
-	{
-		return;
-	}
-
-	int idx = partition( vec, left, right );
-	quicksort( vec, left, idx - 1 );
-	quicksort( vec, idx + 1, right );
+    if (left >= right) return;
+    int i = left - 1, j = right + 1;
+    int x = nums[left + right >> 1];
+    while (i < j)
+    {
+        while (nums[++i] < x);
+        while (nums[--j] > x);
+        if (i < j) swap(nums[i], nums[j]);
+    }
+    quick_sort(nums, left, j);
+    quick_sort(nums, j + 1, right);
 }
 
-
-int main( void )
+int main()
 {
-	vector<int> vec = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
-	printvec( vec );
-	quicksort( 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]);
+    quick_sort(nums, 0, n - 1);
+    for (int i = 0; i < n; ++i) printf("%d ", nums[i]);
+}

basic/sorting/QuickSort/Main.java

@@ -10,7 +10,7 @@ public static void main(String[] args) {
         }
         quickSort(nums, 0, n - 1);
         for (int i = 0; i < n; ++i) {
-            System.out.printf("%d ", nums[i]);
+            System.out.print(nums[i] + " ");
         }
     }
 
@@ -19,7 +19,7 @@ public static void quickSort(int[] nums, int left, int right) {
             return;
         }
         int i = left - 1, j = right + 1;
-        int x = nums[left];
+        int x = nums[(left + right) >> 1];
         while (i < j) {
             while (nums[++i] < x);
             while (nums[--j] > x);

basic/sorting/QuickSort/Main.js

@@ -24,9 +24,7 @@ function quickSort(nums, left, right) {
         while (nums[++i] < x);
         while (nums[--j] > x);
         if (i < j) {
-            const t = nums[i];
-            nums[i] = nums[j];
-            nums[j] = t;
+            [nums[i], nums[j]] = [nums[j], nums[i]];
         }
     }
     quickSort(nums, left, j);

basic/sorting/QuickSort/README.md

@@ -110,16 +110,16 @@ public class Main {
         }
         quickSort(nums, 0, n - 1);
         for (int i = 0; i < n; ++i) {
-            System.out.printf("%d ", nums[i]);
+            System.out.print(nums[i] + " ");
         }
     }
-
+    
     public static void quickSort(int[] nums, int left, int right) {
         if (left >= right) {
             return;
         }
         int i = left - 1, j = right + 1;
-        int x = nums[left];
+        int x = nums[(left + right) >> 1];
         while (i < j) {
             while (nums[++i] < x);
             while (nums[--j] > x);
@@ -291,81 +291,36 @@ fn main() -> io::Result<()> {
 
 ```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";
-	}
 
-	cout << endl;
-	cout << strend << endl;
-}
+const int N = 1e6 + 10;
 
+int n;
+int nums[N];
 
-int partition( vector<int> & vec, int left, int right )
+void quick_sort(int nums[], int left, int right)
 {
-	if ( left >= right )
-	{
-		return left;
-	}
-
-	int base = vec[left];
-	while ( left < right )
-	{
-		while ( left < right && vec[right] >= base )
-		{
-			right--;
-		}
-		if ( left >= right )
-		{
-			break;
-		}
-
-		vec[left] = vec[right];
-
-		while ( left < right && vec[left] <= base )
-		{
-			left++;
-		}
-
-		if ( left >= right )
-		{
-			break;
-		}
-
-		vec[right] = vec[left];
-	}
-
-	vec[left] = base;
-	return left;
-}
-
-
-void quicksort( vector<int> & vec, int left, int right )
-{
-	if ( left >= right )
-	{
-		return;
-	}
-
-	int idx = partition( vec, left, right );
-	quicksort( vec, left, idx - 1 );
-	quicksort( vec, idx + 1, right );
+    if (left >= right) return;
+    int i = left - 1, j = right + 1;
+    int x = nums[left + right >> 1];
+    while (i < j)
+    {
+        while (nums[++i] < x);
+        while (nums[--j] > x);
+        if (i < j) swap(nums[i], nums[j]);
+    }
+    quick_sort(nums, left, j);
+    quick_sort(nums, j + 1, right);
 }
 
-
-int main( void )
+int main()
 {
-	vector<int> vec = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
-	printvec( vec );
-	quicksort( 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]);
+    quick_sort(nums, 0, n - 1);
+    for (int i = 0; i < n; ++i) printf("%d ", nums[i]);
 }
 ```
 

solution/0100-0199/0192.Word Frequency/README_EN.md

@@ -9,13 +9,9 @@
 <p>For simplicity sake, you may assume:</p>
 
 <ul>
-
     <li><code>words.txt</code> contains only lowercase characters and space <code>&#39; &#39;</code> characters.</li>
-
     <li>Each word must consist of lowercase characters only.</li>
-
     <li>Words are separated by one or more whitespace characters.</li>
-
 </ul>
 
 <p><strong>Example:</strong></p>