-
Notifications
You must be signed in to change notification settings - Fork 0
/
binary-search-recursive.java
32 lines (29 loc) · 1.13 KB
/
binary-search-recursive.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
class Solution { //Binary Search, recursive
public int search(int[] nums, int target) {
int left_idx = 0;
int right_idx = nums.length - 1;
int found_idx = -1;
if ((target < nums[left_idx]) || (target > nums[right_idx])) {
return found_idx;
}
found_idx = Solution.searchRecursive(nums, target, left_idx, right_idx);
return found_idx;
}
public static int searchRecursive(int[] nums, int target, int left_idx, int right_idx) {
int mid_idx = left_idx + (right_idx - left_idx)/2;
mid_idx = (int)Math.floor(mid_idx);
int found_idx = -1;
if (target < nums[mid_idx]) {
right_idx = mid_idx - 1;
found_idx = Solution.searchRecursive(nums, target, left_idx, right_idx);
}
if (target == nums[mid_idx]) {
found_idx = mid_idx;
}
if (target > nums[mid_idx]) {
left_idx = mid_idx + 1;
found_idx = Solution.searchRecursive(nums, target, left_idx, right_idx);
}
return found_idx;
}
}