forked from PrajaktaSathe/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBitonicArraySearch.java
More file actions
78 lines (78 loc) · 1.5 KB
/
BitonicArraySearch.java
File metadata and controls
78 lines (78 loc) · 1.5 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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
//Program to search in a Bitonic Array
import java.util.Scanner;
public class BitonicArraySearch {
static int ascendingBS(int a[], int k, int range) {
int l=0,h=range,m=0;
while(l<=h) {
m=(l+h)/2;
if(a[m]==k) {
return m;
}else if(k<a[m]){
h=m-1;
}else {
l=m+1;
}
}
return -1;
}
static int descendingBS(int a[], int k, int range) {
int l=range,h=a.length-1,m=0;
while(l<=h) {
m=(l+h)/2;
if(a[m]==k) {
return m;
}else if(k<a[m]){
l=m+1;
}else {
h=m-1;
}
}
return -1;
}
static int bitonicpoint(int a[]) {
int l=0,r=a.length-1,m=0;
while(l<=r) {
m=(l+r)/2;
if(a[m]>a[m-1] && a[m]>a[m+1]) {
return m;
}else if(a[m]>a[m-1] && a[m]<a[m+1]){
l=m;
}else {
r=m+1;
}
}
return -1;
}
static int searchbitonic(int a[],int k,int bindex) {
if(k==a[bindex]) {
return bindex;
}
if(k>a[bindex]) {
return -1;
}
int res1=ascendingBS(a, k, bindex-1);
int res2=descendingBS(a, k, bindex+1);
if (res1!=-1) {
return res1;
}
else if(res2!=-1) {
return res2;
}
return -1;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.print("Enter Number:");
int k=sc.nextInt();
int a[]= {1,3,6,7,9,12,8,5,2};
int bindex=bitonicpoint(a);
int b=searchbitonic(a, k, bindex);
if (b == -1) {
System.out.println("Element Not Found In Sequence");
}
else {
System.out.println("Element Found at index: "+ b);
}
}
}