Merge pull request VAR-solutions#1232 from Priyansh2001here/dev

i-vishi · web-flow · commit 120aaef8c585 · 2020-10-02T10:50:35.000+05:30
Create linear_search.rs
diff --git a/Searching/Linear Search/linear_search.rs b/Searching/Linear Search/linear_search.rs
@@ -0,0 +1,21 @@
+fn linear_search(v : &Vec<i32>, value : i32) -> i32{
+    for (i, &j ) in v.iter().enumerate() {
+        if j == value{
+            return i as i32;
+        }
+    }
+    return i32::MAX;
+}
+
+
+fn main() {
+    println!("Hello, world!");
+    let v : Vec<i32> = vec![1,2,3,4,5,9,0];
+    let index = linear_search(&v, 4);
+    if index != i32::MAX{
+        println!("index of element is -> {}", index);
+    }
+    else {
+        println!("Element not found");
+    }
+}
diff --git a/Searching/binary search/rust/binary_search.rs b/Searching/binary search/rust/binary_search.rs
@@ -0,0 +1,32 @@
+fn binary_search(v : &Vec<i32>, value : i32) -> i32{
+    let mut low = 0;
+    let mut high = v.len()-1;
+
+    while low <= high {
+
+        let mid  = (low+high)/2;
+
+        if value > v[mid]{
+            low = mid+1;
+        }
+        else if value < v[mid] {
+            high = mid-1;
+        }else {
+            return mid as i32;
+        }
+    }
+    i32::MAX
+}
+
+
+fn main() {
+    let mut v: Vec<i32> = vec![1, 2, 3, 4, 5, 9, 0];
+    v.sort();
+    let index = binary_search(&v, 9);
+    if index != i32::MAX{
+        println!("index of element is -> {}", index);
+    }
+    else {
+        println!("Element not found");
+    }
+}
