(nums: &mut [i32], low: usize, high: usize)
| 1 | // quick_sort.rs |
| 2 | |
| 3 | fn quick_sort1(nums: &mut [i32], low: usize, high: usize) { |
| 4 | if low < high { |
| 5 | let split = partition(nums, low, high); |
| 6 | |
| 7 | // 防止越界和语法错误（split <= 1 的情形） |
| 8 | if split > 1 { |
| 9 | quick_sort1(nums, low, split - 1); |
| 10 | } |
| 11 | quick_sort1(nums, split + 1, high); |
| 12 | } |
| 13 | } |
| 14 | |
| 15 | // 计算分割点 |
| 16 | fn partition(nums: &mut [i32], low: usize, high: usize) -> usize { |