var searchBinary = function (item, sortedArray) {
      var NOT_FOUND = -1;
      if (!sortedArray || !sortedArray.length) {
        return NOT_FOUND;
      }
      var low = 0;
      var high = sortedArray.length - 1;
      var middle;
      var guess;
      while (low <= high) {
        middle = Math.floor((high + low) / 2);
        guess = sortedArray[middle];
        if (guess === item) {
          return middle;
        }
        if (guess > item) {
          high = middle - 1;
        } else {
          low = middle + 1;
        }
      }
      return NOT_FOUND;
    };

var sortedArray = [];
var ID_OBJ = {}

for (let i = 0; i <= 1000000; i++) {
	sortedArray[i] = i;
	ID_OBJ[i] = 1;
}