binary search

This video explains the binary searching algorithm

by Tintu Raju

HTML

<input type="text" value="10,20,30,40,50,60,70,80,90,100" id="numbers">
<input type="text" value="30" id="search">
<button id="searchList">Search</button>

JavaScript

// 10 20  30 40 50 60 70 80 90 100 110 120 130 140 150 160 

function binary_search(list,low,up,number){
    
    if(low>=up) return 0;
    let middle = Math.ceil((low+up)/2);

    if(number==list[middle]){
      return middle+1;
    }
    else if(number>list[middle]){
       return binary_search(list,middle+1,up,number);
    }
    else{
       return binary_search(list,low,middle-1,number);
    }
   
}

document.querySelector("#searchList").addEventListener("click",function(){
    let list = document.querySelector("#numbers").value.split(",")
    let low = 0;
    let up = list.length-1;
    let number = parseInt(document.querySelector("#search").value);  
    console.log( binary_search(list,low,up,number) );
})