Binary search recursive implementation

Jcateye · Oct 30, 2018 · 44a2376 · 44a2376
1 parent 37b6197
commit 44a2376
Showing 1 changed file with 20 additions and 0 deletions.
diff --git a/scala/15_bsearch/BSearchRecursive.scala b/scala/15_bsearch/BSearchRecursive.scala
@@ -0,0 +1,20 @@
+object BSearchRecursive {
+    def search(nums: Array[Int], target: Int): Int = {
+        return searchInternal(nums, target, 0, nums.length - 1)
+    }
+
+    def searchInternal(nums:Array[Int], target: Int, low: Int, high: Int): Int = {
+        if(low <= high){
+            val mid = low + ((high - low) >> 2)
+            if(nums(mid) > target){
+                searchInternal(nums, target, low, mid - 1)
+            } else if (nums(mid) < target){                
+                searchInternal(nums, target, mid + 1, high)
+            } else {
+                return mid
+            }
+        }else{
+            return -1    
+        }
+    }
+}