-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
54 lines (43 loc) · 1.42 KB
/
Solution.java
File metadata and controls
54 lines (43 loc) · 1.42 KB
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
package algorithm_Binary_Search;
//import java.io.*;
//import java.util.*;
//import java.text.*;
//import java.math.*;
//import java.util.regex.*;
public class Solution {
public static boolean binarySearchIterative(int[] array, int x) {
int left = 0;
int right = array.length - 1;
while (left <= right) {
int mid = left + ((right - left) /2);
if (array[mid] == x) {
return true;
} else if (x < array[mid]) {
right = mid - 1;
//return binarySearchIterative(array, x, left, mid - 1);
} else {
left = mid + 1;
//return binarySearchIterative(array, x, mid + 1, right);
}
}
return false;
}
public static boolean binarySearchRecursive(int[] array, int x, int left, int right) {
if (left > right) {
return false;
}
int mid = left + ((right - left) /2);
if (array[mid] == x) {
return true;
} else if (x < array[mid]) {
return binarySearchRecursive(array, x, left, mid - 1);
} else {
return binarySearchRecursive(array, x, mid + 1, right);
}
}
public static boolean binarySearchRecursive(int[] array, int x) {
return binarySearchRecursive(array, x, 0, array.length -1);
}
public static void main(String[] args) {
}
}