gs gs122 Searching - Uniform Binary Search - Quiz No.1

 public static void make_delta(int N) { int power = 0; int i = 0; do { int half = power; power <<= 1; delta[i] = (N + half) / power; } while (delta[i++] != 0); }

 public static void make_delta(int N) { int power = 1; int i = 0; do { int half = power; power >>= 1; delta[i] = (N + half) / power; } while (delta[i++] != 0); }

 public static void make_delta(int N) { int power = 1; int i = 0; do { int half = power; power <<= 1; delta[i] = (N - half) / power; } while (delta[i++] != 0); }

 public static int unisearch(int key) { int i = delta[0] - 1; int j = 0; while (true) { if (key == arr[i]) return i; else if (delta[j] == 0) return -1; else { if (key < arr[i]) i += delta[++j]; else i -= delta[++j]; } } }

 public static int unisearch(int key) { int i = delta[1] - 1; int j = 0; while (true) { if (key == arr[i]) return i; else if (delta[j] == 0) return -1; else { if (key < arr[i]) i -= delta[++j]; else i += delta[++j]; } } }

 public static int unisearch(int key) { int i = delta[0] - 1; int j = 0; while (true) { if (key == arr[i]) return i; else if (delta[j] == 0) return -1; else { if (key < arr[i]) i += delta[++j]; else i += delta[++j]; } } }