function binarySearch(value) {     var startIndex = 0,         stopIndex = words.length - 1,         middle = Math.floor((stopIndex + startIndex) / 2);      while (words[middle] != value && startIndex < stopIndex) {         // adjust searc...
I'm trying to implement Binary search and everything works fine for all the numbers except the corner cases:    const a = [1,2,3,4,5];  function findNum(arr, num) {     let start=0, end = arr.length-1, mid = Math.floor((start+end)/2);      while(...
Why is my algorithm returning “-1” meaning that target value 73 isn’t in the array? (When clearly 73 is in the array). [this is from Khan Academy, but isn't helping]  It's supposed to return either the index of the location in the array...
The following code seems to be unable to find the number in the list. Why might this be?  Trying this with the number to search for as '9' and the array of numbers consisting of numbers between 1-10 inclusively.    array = [1, 2, 3, 4, 5, 6,...
I'm trying to find a number between min and max. I only know (through using the more method) whether the number I'm guessing is higher or lower than the number passed. The number that I need to find can be a decimal, which is what is making m...
I'm almost embarrassed to ask this question but for whatever reason I cannot get this to work. It's a Khan Academy exercise on binary searches. https://www.khanacademy.org/computing/computer-science/algorithms/binary-searc...
A sorted array of numbers is given.  The idea is that for any given number, the code needs to find the two enclosing indices in the array such that:  array[a] <= query <= array[b]   For example, if the given array is [1, 20, 56, 200] and the nu...
Following code finds if a given number is a perfect square in O(lg N). How can I avoid hard-coding the corner case if (num === 1) { return true; } given in the solution below? Any ideas?  var isPerfectSquare = function(num) {     let floor = 0, ceili...
The performance of my brute force and searches are   Iterative Took 0.1000 milliseconds to generate:  Recursive Took 0.1500 milliseconds to generate:  Brute Took 0.0800 milliseconds to generate:   I understand that recursive searches suffer from tail...
I am trying to finish a quiz on Khan Academy. It asks me to only print the total number of guesses when it has found the target.  The link to the quiz:  link   /* Returns either the index of the location in the array,   or -1 if the array did not con...

Tags

Recent Questions

Top Questions

Home Tags Terms of Service Privacy Policy DMCA Contact Us

©2020 All rights reserved.