pub fn insercion_ordenada<T: Ord>(arr: &mut [T]) { for i in 1..arr.len() { let mut j = i; while j > 0 && arr[j] < arr[j - 1] { arr.swap(j, j - 1); j = j - 1; } } } fn main() { let mut arr = [4, 8, 2, 10, 1, 6, 5, 9, 7, 3]; println!("{:?}", arr); insercion_ordenada(&mut arr); println!("{:?}\n", arr); }