[rust] Adiciona Algoritmos de Ordenação gnomeSort

README.md

@@ -54,7 +54,7 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
 | [Cocktail Sort][37] | C/C++ | Java | Python | [Go](./src/go/cocktailsort/cocktailsort.go) | Ruby | JS | Pascal | Swift | Rust |
 | [Comb Sort][38] | C/C++ | Java | Python | [Go](./src/go/combsort/combsort.go) | Ruby | [JS](./src/javascript/CombSort.js) | Pascal | Swift | Rust |
 | [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 |
+| [Gnome Sort][40] | C/C++ | Java | Python | [Go](./src/go/gnomesort/gnomesort.go) | Ruby | JS | Pascal | Swift | [Rust](./src/rust/gnomesort.rs) |
 | [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](./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 |

src/rust/gnomesort.rs

@@ -0,0 +1,20 @@
+fn main(){
+ println!("{:?}", gnomesort(vec![1,3,5,2]));
+}
+fn gnomesort(mut slice: Vec<i32>) -> Vec<i32> {
+ let mut pivot: i32 = 0;
+ let size: i32 = slice.len() as i32;
+
+ while pivot < size - 1 {
+ if slice[pivot as usize] > slice[pivot as usize + 1] {
+ let temp: i32 = slice[pivot as usize];
+ slice[pivot as usize] = slice[pivot as usize + 1];
+ slice[pivot as usize + 1] = temp;
+ if pivot > 0 {
+ pivot -= 2;
+ }
+ }
+ pivot += 1;
+ }
+ slice
+}