binarySearch method

int binarySearch(int element)

Implementation

int binarySearch(int element) {
  var low = 0;
  var high = top;
  while (high > low) {
    var mid = ((high + low) / 2).floor();
    var mid_element = get(mid);
    if (element == mid_element) {
      return mid;
    } else if (element < mid_element) {
      high = mid;
    } else {
      low = mid + 1;
    }
  }

  return -low;
}