update rust codes for hash_map, binary_search, bubble_sort, stack, queue (#330)

* update rust codes * update rust codes * update rust codes * update and add rust codes for hash_map, binary_search, bubble_sort * update and add rust codes for hash_map, binary_search, bubble_sort * add rust codes for chapter stack * add rust codes for chapter queue * add rust codes for chapter deque
2026-07-10 06:26:08 +00:00 · 2023-02-05 16:25:42 +08:00
parent 93ca29ca6d
commit 8a388d8422
21 changed files with 559 additions and 280 deletions
@@ -0,0 +1,53 @@
+/**
+ * File: bubble_sort.rs
+ * Created Time: 2023-02-05
+ * Author: sjinzh (sjinzh@gmail.com)
+*/
+
+/* 冒泡排序 */
+fn bubble_sort(nums: &mut [i32]) {
+    // 外循环：待排序元素数量为 n-1, n-2, ..., 1
+    for i in (1..nums.len()).rev() {
+        // 内循环：冒泡操作
+        for j in 0..i {
+            if nums[j] > nums[j + 1] {
+                // 交换 nums[j] 与 nums[j + 1]
+                let tmp = nums[j];
+                nums[j] = nums[j + 1];
+                nums[j + 1] = tmp;
+            }
+        }
+    }
+}
+
+/* 冒泡排序（标志优化） */
+fn bubble_sort_with_flag(nums: &mut [i32]) {
+    // 外循环：待排序元素数量为 n-1, n-2, ..., 1
+    for i in (1..nums.len()).rev() {
+        let mut flag = false;   // 初始化标志位
+        // 内循环：冒泡操作
+        for j in 0..i {
+            if nums[j] > nums[j + 1] {
+                // 交换 nums[j] 与 nums[j + 1]
+                let tmp = nums[j];
+                nums[j] = nums[j + 1];
+                nums[j + 1] = tmp;
+                flag = true;        // 记录交换元素
+            }
+        }
+        if !flag {break};           // 此轮冒泡未交换任何元素，直接跳出
+    }
+}
+
+/* Driver Code */
+pub fn main() {
+    let mut nums = [ 4, 1, 3, 1, 5, 2 ];
+    bubble_sort(&mut nums);
+    print!("冒泡排序完成后 nums = ");
+    inc::print_util::print_array(&nums);
+
+    let mut nums1 = [ 4, 1, 3, 1, 5, 2 ];
+    bubble_sort_with_flag(&mut nums1);
+    print!("\n冒泡排序完成后 nums1 = ");
+    inc::print_util::print_array(&nums1);
+}