Algorithms/BitonicArray.java at master · manish160993/Algorithms · GitHub

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
classBitonicArray{

voidXsort(int[] A,intp,intr){
intn=r-p+1;
if(n<=1)
return;
if(A[p]>A[r])
 {
intx=A[p];
A[p]=A[r];
A[r]=x;
 }
if(n==2)
return;
intnb3=n/3;
Xsort(A,p,r-nb3);
Xsort(A,p+nb3,r);
Xsort(A,p,r-nb3);
	}


intfindBitonic(int[] A,intp,intr){
intq=(p+r)/2;
//System.out.print(q+" ");
if(A[q-1]>A[q] && A[q]>A[q+1])
returnfindBitonic(A,p,q);
elseif(A[q-1]<A[q] && A[q]>A[q+1])
returnA[q];
else
returnfindBitonic(A,q,r);

	}

intSearch(int[] a,intp,intr, intx){
intq=(p+r)/2;
if(x<a[q]){
returnSearch(a,p,q,x);
 }
elseif(x>=a[q]&&x<a[q+1])
returnq;
else
returnSearch(a,q+1,r,x);
	}

publicstaticvoidmain(String[] args){
inta[]={5,4,3,2,6,7};
BitonicArrayb=newBitonicArray();
//System.out.println(b.findBitonic(a,0,a.length-1));
//System.out.println(b.Search(a,0,a.length-1,7));
b.Xsort(a,0,a.length-1);
for(inti=0;i<a.length;i++)
System.out.print(a[i]+" ");
	}
}