GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Java/Programs/ExponentialSearch.java at main · arshcoder13/Java Expand file tree/ Copy pathExponentialSearch.javaMore file actions 33 lines (27 loc) · 618 Bytes / Copy pathExponentialSearch.javaFile metadata and controls33 lines (27 loc) · 618 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 // Java program to implement Exponential search. import java.util.Arrays; class ExponentialSearch { static int exponentialSearch(int arr[], int n, int x) { if (arr[0] == x) return 0; int i = 1; while (i < n && arr[i] <= x) i = i*2; return Arrays.binarySearch(arr, i/2, Math.min(i, n-1), x); } 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); } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |