[Algorithms] Binary Search Algorithm using TypeScript

(binary search trees) which form the basis of modern databases and immutable data structures. Binary search works very much the way humans intuitively search for a name in a yellow pages directory (if you have ever seen one) or the dictionary.

In this lesson we learn how to implement a Binary Search Algorithm using TypeScript / Javascript, and we describe the problem that it solves.

function binarySearch(
  array: number[],
  element: number,
  start: number = ,
  end: number= array.length -
): number {

   if(end < start) {
     return -;
   }

    const middle = Math.floor((start + end) / );
  return element === array[middle]
    ? middle
    : element < array[middle]
      ? binarySearch(array, element, start, middle - )
      : binarySearch(array, element, middle + , end);
}

const unsortedArray = [ , , , , , , , , , ]

console.log("Index of 4: ", binarySearch(unsortedArray.sort(), ))
console.log("22 not found: ", binarySearch(unsortedArray.sort(), ))