forked from darpanjbora/Java-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathexponential_search.java
More file actions
37 lines (32 loc) · 847 Bytes
/
exponential_search.java
File metadata and controls
37 lines (32 loc) · 847 Bytes
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
// Java program to
// find an element x in a
// sorted array using
// Exponential search.
import java.util.Arrays;
class exponential_search
{
// Returns position of
// first occurrence of
// x in array
static int exponentialSearch(int arr[],int n, int x)
{
// If x is present at first location itself
if (arr[0] == x)
return 0;
// Find range for binary search by
// repeated doubling
int i = 1;
while (i < n && arr[i] <= x)
i = i*2;
// Call binary search for the found range.
return Arrays.binarySearch(arr, i/2,Math.min(i, n-1), x);
}
// Driver code
public static void main(String args[])
{
int arr[] = {2, 3, 4, 10, 40};
int x = 10;
int result = exponentialSearch(arr,arr.length, x);
System.out.println((result < 0) ? "Element is not present in array" : "Element is present at index " + result);
}
}