JavaScript: Search JavaScript arrays with a binary search

JavaScript Function: Exercise-18 with Solution

Write a function for searching JavaScript arrays with binary searches.

Note : A binary search searches by splitting an array into smaller and smaller chunks until it finds the desired value.

Pictorial Presentation:

JavaScript:  Search JavaScript arrays with a binary search

Sample Solution: -

HTML Code:

<!DOCTYPE html>
<meta charset=utf-8 />
<title>Search JavaScript arrays with a binary search</title>

JavaScript Code:

function array_binarySearch(narray, delement) {
   var mposition = Math.floor(narray.length / 2);

   if (narray[mposition] === delement){
      return mposition;
   else if (narray.length === 1) 
      return null;
   else if (narray[mposition] < delement) {
      var arr = narray.slice(mposition + 1);
      var res = array_binarySearch(arr, delement);
      if (res === null)
         return null;
      else {
         return mposition + 1 + res;
   else {
      var arr1 = narray.slice(0, mposition);
      return array_binarySearch(arr1, delement);

 var myArray = [1, 2, 3, 5, 6, 7, 10, 11, 14, 15, 17, 19, 20, 22, 23];
 console.log(array_binarySearch(myArray, 6));

Sample Output:



Flowchart: JavaScript function: Search JavaScript arrays with a binary search

Live Demo:

See the Pen JavaScript - Search JavaScript arrays with a binary search-function-ex- 18 by w3resource (@w3resource) on CodePen.

Improve this sample solution and post your code through Disqus

Previous: Write a JavaScript function to get the number of occurrences of each letter in specified string.
Next: Write a JavaScript function that returns array elements larger than a number.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

Follow us on Facebook and Twitter for latest update.