Function cbic_sort1

code/chapter06/CantBeliveItCanSort.rs:4–12

升序排序

(nums: &mut [i32])

// 升序排序
fn cbic_sort1(nums: &mut [i32]) {
    for i in 0..nums.len() {
        for j in 0..nums.len() {
            if nums[i] < nums[j] {
                nums.swap(i, j);
            }
        }
    }
}

// 升序排序优化版
fn cbic_sort2(nums: &mut [i32]) {