Merge pull request kelvins#66 from heitor582/main

[rust] Adiciona algoritmo de ordenação insertion_sort

Author: kelvins

README.md

@@ -56,7 +56,7 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
 | [Counting Sort][39]                       | C/C++ | Java | Python | [Go](./src/go/countingsort/countingsort.go) | [Ruby](./src/ruby/count_sort.rb) | JS | Pascal | Swift | Rust |
 | [Gnome Sort][40]                          | C/C++ | Java | Python | [Go](./src/go/gnomesort/gnomesort.go) | Ruby | JS |  Pascal | Swift | Rust |
 | [Heapsort][41]                            | C/C++ | [Java](./src/java/HeapSort.java) | Python | [Go](./src/go/heapsort/heapsort.go) | [Ruby](./src/ruby/heap_sort.rb) | [JS](./src/javascript/HeapSort.js) | [Pascal](./src/pascal/heapsort.pas) | Swift | Rust |
-| [Insertion Sort][42]                      | [C/C++](./src/c/InsertionSort.cpp) | [Java](./src/java/InsertionSort.java) | [Python](./src/python/insertion_sort.py) | [Go](./src/go/insertionsort/insertionsort.go) | [Ruby](./src/ruby/insertion_sort.rb) | [JS](./src/javascript/InsertionSort.js) |  Pascal | Swift | Rust |
+| [Insertion Sort][42]                      | [C/C++](./src/c/InsertionSort.cpp) | [Java](./src/java/InsertionSort.java) | [Python](./src/python/insertion_sort.py) | [Go](./src/go/insertionsort/insertionsort.go) | [Ruby](./src/ruby/insertion_sort.rb) | [JS](./src/javascript/InsertionSort.js) |  Pascal | Swift | [Rust](./src/rust/insertion_sort.rs) |
 | [Merge Sort][44]                          | [C/C++](./src/c/MergeSort.c) | [Java](./src/java/Mergesort.java) | Python | [Go](./src/go/mergesort/mergesort.go) | [Ruby](./src/ruby/merge_sort.rb) | [JS](./src/javascript/MergeSort.js) | [Pascal](./src/pascal/mergesort.pas) | Swift | Rust |
 | [Quicksort][45]                           | [C/C++](./src/c/QuickSort.cpp) | [Java](./src/java/Quicksort.java) | [Python](./src/python/quick_sort.py) | [Go](./src/go/quicksort/quicksort.go) | [Ruby](./src/ruby/quick_sort.rb) | [JS](./src/javascript/QuickSort.js) |  Pascal | Swift | Rust |
 | [Radix Sort][46]                          | C/C++ | [Java](./src/java/RadixSort.java) | Python | [Go](./src/go/radixsort/radixsort.go) | [Ruby](./src/ruby/radix_sort.rb) | [JS](./src/javascript/RadixSort.js) | Pascal | Swift | Rust |

src/rust/insertion_sort.rs

@@ -0,0 +1,13 @@
+fn main(){
+  println!{"{:?}", insertion_sort(vec![54,42,11,33,24,99,77,80])};
+}
+fn insertion_sort(mut vetor: Vec<i32>) -> Vec<i32> {
+  for i in 1..vetor.len() {
+    let mut index: i32 = i as i32;
+    while index > 0 && vetor[index as usize] < vetor[index as usize - 1] {
+      vetor.swap(index as usize, index as usize - 1);
+      index -= 1;
+    }
+  }
+  vetor
+}

src/rust/palindromo.rs

@@ -7,7 +7,7 @@ fn main() {
     println!("{:?}", palindromo("Was it a palindrome?".to_string()));
     println!("{:?}", palindromo("No lemon, no melon".to_string()));
 }
-pub fn palindromo(mut word: String) -> bool {
+fn palindromo(mut word: String) -> bool {
     word = word.to_lowercase().split_whitespace().collect::<String>();
     let reversed_string: String = word.chars().rev().collect::<String>();
     if word.len() <= 1 {