Breaking News: Grepper is joining You.com. Read the official announcement!

binary search in js

Add Answer

Ball Handler answered on September 15, 2021 Popularity 10/10 Helpfulness 6/10

answer binary search in js

related binary search in js

related Binary Search Algorithm in javascript

related js binary search

related binary search javascript

related JS binary search

related binary search in js

related binary search javascript

binary search in js

Comment

function binarySearch(arr, val) {
  let start = 0;
  let end = arr.length - 1;

  while (start <= end) {
    let mid = Math.floor((start + end) / 2);

    if (arr[mid] === val) {
      return mid;
    }

    if (val < arr[mid]) {
      end = mid - 1;
    } else {
      start = mid + 1;
    }
  }
  return -1;
}

Popularity 10/10 Helpfulness 6/10 Language javascript

Source: stackoverflow.com

Tags: binary-search javascript

Link to this answer
Share Copy Link

Contributed on Sep 15 2021

Ball Handler

0 Answers Avg Quality 2/10

Closely Related Answers

binary search in js

Comment

function binarySearch(sortedArray, key){
    let start = 0;
    let end = sortedArray.length - 1;

    while (start <= end) {
        let middle = Math.floor((start + end) / 2);

        if (sortedArray[middle] === key) {
            // found the key
            return middle;
        } else if (sortedArray[middle] < key) {
            // continue searching to the right
            start = middle + 1;
        } else {
            // search searching to the left
            end = middle - 1;
        }
    }
	// key wasn't found
    return -1;
}

Popularity 9/10 Helpfulness 5/10 Language javascript

Source: stackabuse.com

Tags: binary-search bi

Link to this answer
Share Copy Link

Contributed on Oct 07 2022

SHIVAM GUPTA

0 Answers Avg Quality 2/10

Binary Search Algorithm in javascript

Comment

function binarySearch(array, element) {
    let firstIndex = 0;
    let lastIndex = array.length - 1;
    let middleIndex = Math.floor((firstIndex + lastIndex) / 2);

    while (array[middleIndex] !== element && firstIndex <= lastIndex) {
        if(array[middleIndex] > element) {
                lastIndex = middleIndex - 1;
        }else {
                firstIndex = middleIndex + 1;
        }
        middleIndex = Math.floor((firstIndex + lastIndex) / 2);
    }
    return array[middleIndex] === element ? middleIndex : -1;
}

const array = [2, 3, 6, 8, 10, 12];
binarySearch(array, 8); // OutPut -> 3

Popularity 9/10 Helpfulness 5/10 Language javascript

Source: dev.to

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Sep 17 2022

Depressed Deer

0 Answers Avg Quality 2/10

js binary search

Comment

function binarySearch(arr, val) {
  let start = 0;
  let end = arr.length - 1;

  while (start <= end) {
    let mid = Math.floor((start + end) / 2);

    if (arr[mid] === val) {
      return mid;
    }

    if (val < arr[mid]) {
      end = mid - 1;
    } else {
      start = mid + 1;
    }
  }
  return -1;
}

Popularity 9/10 Helpfulness 4/10 Language javascript

Source: stackoverflow.com

Tags: binary-search bi

Link to this answer
Share Copy Link

Contributed on Sep 09 2022

Alexey Volkov

0 Answers Avg Quality 2/10

binary search javascript

Comment

const arr = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30];


const binarySearch = (arr, x , start=0, end=arr.length) => {
  if(end < start) return -1;
  
  let mid = Math.floor((start + end) / 2);
  
  if(arr[mid] === x) return mid;

  if(arr[mid] < x) return binarySearch(arr, x, mid+1, end);
  
  else return binarySearch(arr, x , start, mid-1);
}

console.log(arr[binarySearch(arr,8)]);

Popularity 10/10 Helpfulness 4/10 Language javascript

Source: stickynotepickles.herokuapp.com

Tags: binary-search bi

Link to this answer
Share Copy Link

Contributed on Dec 20 2021

Clean Crocodile

0 Answers Avg Quality 2/10

JS binary search

Comment

// JavaScript program to implement recursive Binary Search
  
// A recursive binary search function. It returns
// location of x in given array arr[l..r] is present,
// otherwise -1
function binarySearch(arr, l, r, x){
    if (r >= l) {
        let mid = l + Math.floor((r - l) / 2);
  
        // If the element is present at the middle
        // itself
        if (arr[mid] == x)
            return mid;
  
        // If element is smaller than mid, then
        // it can only be present in left subarray
        if (arr[mid] > x)
            return binarySearch(arr, l, mid - 1, x);
  
        // Else the element can only be present
        // in right subarray
        return binarySearch(arr, mid + 1, r, x);
    }
  
    // We reach here when element is not
    // present in array
    return -1;
}
  
let arr = [ 2, 3, 4, 10, 40 ];
let x = 10;
let n = arr.length
let result = binarySearch(arr, 0, n - 1, x);
(result == -1) ? document.write( "Element is not present in array")                   : document.write("Element is present at index " +result);

Popularity 10/10 Helpfulness 4/10 Language javascript

Source: Grepper

Tags: binary-search bi

Link to this answer
Share Copy Link

Contributed on Feb 25 2022

Dentetsu

0 Answers Avg Quality 2/10

binary search in js

Comment

function binarySearch(sortedArray, key){
    let start = 0;
    let end = sortedArray.length - 1;

    while (start <= end) {
        let middle = Math.floor((start + end) / 2);

        if (sortedArray[middle] === key) {
            // found the key
            return middle;
        } else if (sortedArray[middle] < key) {
            // continue searching to the right
            start = middle + 1;
        } else {
            // search searching to the left
            end = middle - 1;
        }
    }
	// key wasn't found
    return -1;
}

Popularity 9/10 Helpfulness 4/10 Language javascript

Source: stackabuse.com

Tags: binary-search bi

Link to this answer
Share Copy Link

Contributed on Oct 07 2022

SHIVAM GUPTA

0 Answers Avg Quality 2/10

binary search javascript

Comment

function binarySearch(arr, target) {
  let low = 0;
  let high = arr.length - 1;
  
  while (low <= high) {
    let mid = Math.floor((low + high) / 2);
    
    if (arr[mid] === target) {
      return mid; // Target found, return the index
    } else if (arr[mid] < target) {
      low = mid + 1; // Target is in the right half of the remaining array
    } else {
      high = mid - 1; // Target is in the left half of the remaining array
    }
  }
  
  return -1; // Target not found
}

// Example usage:
const numbers = [2, 4, 6, 8, 10, 12, 14, 16, 18, 20];
const target = 12;

console.log(binarySearch(numbers, target)); // Output: 5 (index of 12 in the array)

Popularity 6/10 Helpfulness 3/10 Language javascript

Source: Grepper

Link to this answer
Share Copy Link

Contributed on Sep 12 2023

YOU.com

0 Answers Avg Quality 2/10

binary search in js

Contents

More Related Answers

binary search in js

Closely Related Answers

binary search in js

Binary Search Algorithm in javascript

js binary search

binary search javascript

JS binary search

binary search in js

binary search javascript

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.