Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 6 additions & 4 deletions rust/11_sorts/insertion_sort.rs
Original file line number Diff line number Diff line change
Expand Up @@ -2,26 +2,28 @@
/// 时间复杂度:O(n2),原地排序算法, 稳定排序算法
// 插入排序
fn insertion_sort(mut nums: Vec<i32>) -> Vec<i32> {
if nums.is_empty() { return vec![]; }
if nums.is_empty() {
return vec![];
}

for i in 1..nums.len() {
let value = nums[i];
let mut j = (i - 1) as i32;
// 查找要插入的位置并移动数据
while j >= 0 {
if nums[j as usize] > value {
nums[(j+1) as usize] = nums[j as usize];
nums[(j + 1) as usize] = nums[j as usize];
} else {
break;
}
j -= 1;
}
nums[(j+1) as usize] = value;
nums[(j + 1) as usize] = value;
}
nums
}

fn main() {
let nums = vec![4, 5, 6, 1, 2, 3];
println!("{:?}", insert_on_sort(nums));
println!("{:?}", insertion_sort(nums));
}