Algorithms - Implement Binary Search

Tell us what’s happening:
Describe your issue in detail here.

Recursive Function and return flow of programming is very beautiful. I never thought return has that many depth and complicated untill I used with recursive function.
Although I solved the Binary Search problem with some work around. But I want to learn the flow of return statement in recursive statement and how can I overcome the following code issues. which is instead of returning “value not found” its returning items in arrayPath.
Please, anyone if known answer in details not in one line.

Your code so far

function binarySearch(searchList, value,arr) {
  let arrayPath =arr;
  let mid= Math.floor((searchList.length-1)/2)  
      return arrayPath;
    else if(searchList[mid]>value){
    else {
    return arrayPath = 'Value Not Found';
  return arrayPath;

const testArray = [
  0, 1, 2, 3, 4, 5, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22,
  23, 49, 70

Your browser information:

User Agent is: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/ Safari/537.36

Challenge: Algorithms - Implement Binary Search

Link to the challenge:

    // return arrayPath = 'Value Not Found';
    arrayPath.push('Value Not Found');

  if(arrayPath.slice(-1,) == 'Value Not Found') return 'Value Not Found'
  return arrayPath;

Not the best solution :rofl:

This topic was automatically closed 182 days after the last reply. New replies are no longer allowed.