docs: public static int search(int[] intArray, int value) { 
          int start = 0;
          int end = intArray.length - 1;
          int middle = 0;
          
          while(start <= end) {
              middle = (start + end) >> 1;
          
              if(value == intArray[middle]) {
                  return middle;
              }
              
              if(value < intArray[middle]) {
                  end = middle - 1 ;
              }
              else {
                  start = middle + 1;
              }
          }
                  
  
          return -1;
      }