Javascript Binary search Implementation

binary_search.js

const binary_search = (list, item) => {
  let min = 0;
  let max = list.length - 1;
  let middle_index = Math.floor((min + max)/2);

  while(min <= max){
    if(list[middle_index] == item) {
        return list[middle_index];
    }

    if(list[middle_index] > item) {
      max = middle_index - 1;
    }else{
      min = middle_index + 1;
    }

    middle_index = Math.floor((min + max)/2);
    if(middle_index == item){
      return list[middle_index];
    }
  }

  return -1;
};


const result = binary_search([1,3,5,10,44,434,444,54], 44);
console.log(`what is result ${result}`);