-
Notifications
You must be signed in to change notification settings - Fork 8
Expand file tree
/
Copy pathSolutionJava.java
More file actions
44 lines (37 loc) · 1.24 KB
/
SolutionJava.java
File metadata and controls
44 lines (37 loc) · 1.24 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
import java.util.ArrayList;
import java.util.Arrays;
class SolutionJava{
public static void main (String[] args) {
ArrayList<Integer>arr = new ArrayList<Integer>() ;
arr.add(2) ;
arr.add(3) ;
arr.add(4) ;
arr.add(10) ;
arr.add(10) ;
// Here we'll create two pointers
//start and end which will point to 1st and last element's indexes respectively
int ValueToFind = 10 ;
int start=0;
int end=arr.size()-1; //5
while(start<=end){
//Here we'll select the mid element from the given range of start and end
int mid=start+(end-start)/2;
//if our mid index element is target element we'll print mid
if(arr.get(mid)==ValueToFind){
System.out.print("Index = "+mid);
break;
//here we don't need to check further so we break from loop
}
//if our mid index element is greater than target then it’s sure that our target would be before mid element
//so we set end as mid-1
else if(arr.get(mid)>ValueToFind){
end=mid-1;
}
//else our mid index element is smaller than target then it's sure that our target would be after mid element
//so we set start as mid+1
else{
start=mid+1;
}
}
}
}