binarysearcher
A simple implementation of binary search (implements divide and conquer)
This implementation breaks the array into smaller pieces rather than moving a cursor
Based on CodeKata02: http://codekata.com/kata/kata02-karate-chop/
Pre-requisites
- NodeJS 6.x
Before You Start
- run
npm install
to install dependencies
Usage
- Execute
> node binarysearcher.js
- Then follow the prompt
Tests
-
Execute
> node chop.js