## Welcome to the Treehouse Community

Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.

### Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.

# SOLUTION: JavaScript recursive binary search, REFACTORED!

I noticed that there was a JavaScript solution for the refactored recursive binary search. Here is my solution:

```const listOfNums = [1, 2, 3, 4, 5, 6, 7, 8];
const targetNum = 2;

function recursive(list, target, start=0, end=null) {
if (!end) {
end = list.length - 1;
}

if (start > end) {
return null;
}

const midpoint = Math.floor((start + end) / 2);

if (list[midpoint] == target) {
return midpoint;
} else if (list[midpoint] < target) {
return recursive(list, target, midpoint + 1, end);
} else {
return recursive(list, target, start, midpoint - 1);
}
}

function verify(result) {
console.log(`target found: \${result}`);
}

result = recursive(listOfNum, targetNum);
verify(result);
```