Some binary searching

binarySearch.groovy

/**
 * search the (sorted) array for the indicated value
 * 
 * @return index of the value or -1 when not found.
 */
def search(arr, int val) {
  int min = 0
  int max = arr.size() - 1
  while (max > min) {
    int piv = Math.abs((min + max) / 2)
    if (arr[piv] == val) return piv
    if (arr[piv] > val) max = piv
        else min = piv
    if (piv == 0) break;
  }
  return -1
}

assert search([5, 34, 42, 54, 63, 72, 89, 91, 121], 89) == 6
assert search([5, 34, 42, 54, 63, 72, 89, 91, 121], 32) == -1