build

docs/chapter_sorting/insertion_sort.md

@@ -200,13 +200,13 @@ comments: true
     fn insertion_sort(nums: &mut [i32]) {
         // 外循环：已排序区间为 [0, i-1]
         for i in 1..nums.len() {
-            let (base, mut j) = (nums[i],  (i - 1) as i32);
+            let (base, mut j) = (nums[i], (i - 1) as i32);
             // 内循环：将 base 插入到已排序区间 [0, i-1] 中的正确位置
             while j >= 0 && nums[j as usize] > base {
                 nums[(j + 1) as usize] = nums[j as usize]; // 将 nums[j] 向右移动一位
                 j -= 1;
             }
-            nums[(j + 1) as usize] = base;  // 将 base 赋值到正确位置
+            nums[(j + 1) as usize] = base; // 将 base 赋值到正确位置
         }
     }
     ```