Binary search algorithm searches through a sorted array by repeatedly dividing the search interval in half. This algorithm takes advantage of an array being sorted and reduces the time complexity to O(Log n).
Live link: https://romantic-hopper-55df86.netlify.app/