fix: modify mismatched source code in sorting algorithm

Author: maolonglong

basic/sorting/QuickSort/Main.rs

@@ -1,52 +1,46 @@
+use rand::Rng; // 0.7.2
 use std::io;
 
-fn heap_sort(nums: &mut Vec<i32>) {
-    let n = nums.len();
-    for i in (0..n / 2).rev() {
-        sink(nums, i, n);
+fn quick_sort(nums: &mut Vec<i32>, left: usize, right: usize) {
+    if left >= right {
+        return;
     }
-    for i in (1..n).rev() {
-        let temp = nums[0];
-        nums[0] = nums[i];
-        nums[i] = temp;
-        sink(nums, 0, i);
-    }
-}
 
-fn sink(nums: &mut Vec<i32>, mut i: usize, n: usize) {
-    loop {
-        let left = i * 2 + 1;
-        let right = left + 1;
-        let mut largest = i;
-        if left < n && nums[left] > nums[largest] {
-            largest = left;
-        }
-        if right < n && nums[right] > nums[largest] {
-            largest = right;
+    let random_index = rand::thread_rng().gen_range(left, right + 1);
+    let temp = nums[random_index];
+    nums[random_index] = nums[left];
+    nums[left] = temp;
+
+    let pivot = nums[left];
+    let mut i = left;
+    let mut j = right;
+    while i < j {
+        while i < j && nums[j] >= pivot {
+            j -= 1;
         }
-        if largest == i {
-            break;
+        nums[i] = nums[j];
+        while i < j && nums[i] < pivot {
+            i += 1;
         }
-        let temp = nums[i];
-        nums[i] = nums[largest];
-        nums[largest] = temp;
-        i = largest;
+        nums[j] = nums[i];
     }
+    nums[i] = pivot;
+
+    quick_sort(nums, left, i);
+    quick_sort(nums, i + 1, right);
 }
 
 fn main() -> io::Result<()> {
-    let mut s = String::new();
-    io::stdin().read_line(&mut s)?;
-    let s: Vec<usize> = s.split(' ').map(|s| s.trim().parse().unwrap()).collect();
-    // let n = s[0];
-    let m = s[1];
+    let mut n = String::new();
+    io::stdin().read_line(&mut n)?;
+    let n = n.trim().parse::<usize>().unwrap();
 
     let mut nums = String::new();
     io::stdin().read_line(&mut nums)?;
     let mut nums: Vec<i32> = nums.split(' ').map(|s| s.trim().parse().unwrap()).collect();
 
-    heap_sort(&mut nums);
-    for num in nums.iter().take(m) {
+    quick_sort(&mut nums, 0, n - 1);
+    for num in nums.iter() {
         print!("{} ", num);
     }