AI coding assistant for busy programmers

All

JavaScript

Improve a given function so that it runs in O(log n) time in JavaScript

JavaScript

function findElement(arr, val) {
	var start = 0;
	var end = arr.length - 1;
	var middle = Math.floor((start + end) / 2);

while (arr[middle] !== val && start <= end) {
		if (val < arr[middle]) {
			end = middle - 1;
		} else {
			start = middle + 1;
		}

middle = Math.floor((start + end) / 2);
    }

if (arr[middle] === val) {
     return middle;  // return index of element in array if found 
    } else {  // otherwise return -1 to indicate not found 
     return -1;   // not found 
    }

/*  The above code is a binary search algorithm that runs in O(log n) time. */

/* The below code is a linear search algorithm that runs in O(n) time. */

/* for (var i=0; i<arr.length; i++) {   // loop through array to find element with value of 'val' */

/* if (arr[i] === val) {   // if element with value of 'val' is found, return index of element in array */

/* return i;   // return index of element in array if found */

/* } else {   // otherwise continue looping through array until all elements have been checked */

/* continue;   // continue looping through array until all elements have been checked */

/* } */

/* } */   // end for loop through array to find element with value of 'val' */

🤖 Code Explanation

}

AI coding assistant for busy programmers

Improve a given function so that it runs in O(log n) time in JavaScript

JavaScript

🤖 Code Explanation

More problems solved in JavaScript