Sorting algorithms/Insertion sort: Difference between revisions
Content added Content deleted
(→{{header|Rust}}: Updated to the Rust 1.3.0) |
|||
| Line 2,169: | Line 2,169: | ||
=={{header|Rust}}== |
=={{header|Rust}}== |
||
{{works with|Rust|1.1}} |
|||
<lang rust>fn insertion_sort<T: std::cmp::Ord>(arr: &mut [T]) { |
<lang rust>fn insertion_sort<T: std::cmp::Ord>(arr: &mut [T]) { |
||
for i in |
for i in 1..arr.len() { |
||
let mut j = i; |
let mut j = i; |
||
while j > 0 && arr[j] < arr[j-1] { |
while j > 0 && arr[j] < arr[j-1] { |
||
arr.swap(j, j-1); |
arr.swap(j, j-1); |
||
j = j-1; |
j = j-1; |
||
} |
|||
} |
} |
||
} |
|||
}</lang> |
}</lang> |
||