let array = [2, 2, 2, 3, 2, 3, 11, 2, 34, 5, 455, 54]

binarySearch = (array, value) => {
  let min = 0;
  let max = array.length - 1;
  let mid = Math.floor((min+max)/2);

  while(array[mid] !== value && min < max) {
    if(value < array[mid]) {
      max = mid - 1;
    } else {
      min = mid + 1;
    }
    mid = Math.floor((min+max)/2);
  }

  return (array[mid] === value ? mid : "Not found");
}

const sortedArray = array.sort((a,b) => (a - b));
binarySearch(sortedArray, 455);