JSFiddle - React, Tailwind, and code Playground

by Slico

JavaScript

const orderedArray = [1, 3, 5, 11, 22, 33, 34, 234, 555, 600, 888];

function binarySearch(sortedArray, numberToSearch) {

  let middle = Math.floor(sortedArray.length / 2)
    
  if (sortedArray[middle] === numberToSearch) {
    return `Found at position ${sortedArray[middle]}`;
  }

  if (sortedArray[middle] < numberToSearch) {
    middle = sortedArray.slice(middle, sortedArray.length - 1);
    return binarySearch(middle, numberToSearch)
  }

  if (sortedArray[middle] > numberToSearch) {
    middle = sortedArray.slice(0, middle);
    return binarySearch(middle, numberToSearch)
  }

  return `Not found`
}

console.log(binarySearch(orderedArray, 600))