/
findX.java
85 lines (78 loc) · 1.7 KB
/
findX.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
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
79
80
81
82
83
84
85
public class findX{
public static int find(int[] arr, int x){
return find(arr, x, 0, arr.length-1);
}
private static int find(int[] arr,int x, int left, int right){
if (left > right)
return -1;
int mid = (left+right) >>1;
System.out.println("The mid is " + arr[mid]);
if (arr[mid] == x)
return mid;
if (arr[mid] > arr[left])//left side is sorted normally.
{
if (x >= arr[left] && x <= arr[mid])
return find(arr, x, left, mid);
else
return find(arr, x, mid+1, right);
}
else if (arr[mid] < arr[left]) //Right side is sorted normally.
{
if (x>=arr[mid] && x <= arr[right]){
return find(arr,x,mid+1, right);
}
else{
return find(arr, x, left, mid-1);
}
}
else if (arr[mid] == arr[left]){
if (arr[mid] != arr[right]){
return find(arr, x, mid+1, right);
}
else{
int result = find(arr, x, left, mid-1);
if (result != -1){
return result;
}
else{
return find(arr, x, mid+1, right);
}
}
}
return -1;
}
public static void rotated(int[] arr, int d, int n){
int gcd = gcd(d,n);
int i,j,k;
for (i = 0 ;i < gcd;i++){
int temp = arr[i];
j = i;
while (true){
k = j+d;
if (k >= n)
k = k - n;
if (k == i)
break;
arr[j] = arr[k];
j = k;
}
arr[j] = temp;
}
}
private static int gcd(int a, int b){
if (b == 0) return a;
else return gcd(b, a%b);
}
public static void main(String[] args){
int[] a = new int[10];
for (int i = 0; i < a.length; i++){
a[i] = i;
}
findX.rotated(a, 2, 5);
findX.rotated(a, 2, 5);
System.out.println(findX.find(a, 4));
for(int i = 0; i < a.length;i++){
System.out.print(a[i]);
}
}
}