Function tim_sort

publication/code/chapter07/tim_sort_without_gallop.rs:421–428

timSort 入口

(list: &mut [i32])

// timSort 入口
fn tim_sort(list: &mut [i32]) {
    if list.len() < MIN_MERGE {
       binary_insertion_sort(list);
    } else {
       let mut sort_state = SortState::new(list);
       sort_state.sort();
    }
}

fn main() {
    let mut nums: Vec<i32> = vec![