Added Binary search in Ruby

Author: Muhtadi1Laskar

Haskell/practice.hs

@@ -0,0 +1,7 @@
+module Main where
+ import System.Environment
+ 
+ main :: IO ()
+ main = do
+     args <- getArgs
+     putStrLn ("Hello, " ++ args !! 0)

Ruby/binary_search.rb

@@ -0,0 +1,22 @@
+def binary_search(array, value)
+    lower_bound = 0
+    upper_bound = array.length - 1
+
+    while lower_bound <= upper_bound do
+        mid_point = (upper_bound + lower_bound) / 2
+        mid_value = array[mid_point]
+
+        if value < mid_value
+            upper_bound = mid_point - 1 
+        elsif value > mid_value
+            lower_bound = mid_point + 1
+        elsif value == mid_value
+            return mid_point
+        end
+    end
+    return nil
+end
+
+
+
+

Ruby/bubble_sort.rb

@@ -8,6 +8,3 @@ def bubble_sort(array)
     end
     return array
 end
-
-
-puts bubble_sort([5, 4, 3, 2, 1])

Ruby/insertion_sort.rb

@@ -13,6 +13,3 @@ def insertion_sort(array)
     end
     return array
 end
-
-
-puts insertion_sort([5, 4, 3, 2, 1])

Ruby/linear_search.rb

@@ -6,5 +6,3 @@ def linear_search(array, item)
     end
     return -1
 end
-
-puts linear_search([1, 2, 3, 4, 5], 3)

Ruby/merge_sort.rb

@@ -33,5 +33,3 @@ def merge_sort(array)
 
     return merge(sorted_left, sorted_right)
 end
-
-puts merge_sort([5, 4, 2, 1])

Ruby/selection_sort.rb

@@ -12,5 +12,3 @@ def selection_sort(array)
     end
     return array
 end
-
-puts selection_sort([5, 4, 3, 2, 1])