lostecho/grokking_algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update binarySearch function for es6 recursive (#101)

Browse Source
This commit is contained in:
Alex
2019-03-28 23:52:08 +02:00
committed by Aditya Bhargava
parent c745f5d2a7
commit c23ca90b83
1 changed files with 3 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
01_introduction_to_algorithms/ES6/02_recursive_binary_search.js
View File

@@ -6,7 +6,7 @@
* @param {number} high Highest limit of search in the list * @param {number} high Highest limit of search in the list
* @return {(number | null)} Number if the value is found or NULL otherwise * @return {(number | null)} Number if the value is found or NULL otherwise
*/ */
const binarySearch = ( list, item, low, high ) => { const binarySearch = ( list, item, low = 0, high = list.length - 1 ) => {
let arrLength = list.length; let arrLength = list.length;
while ( low <= high ) { while ( low <= high ) {
let mid = Math.floor((low + high) / 2); let mid = Math.floor((low + high) / 2);
@@ -36,8 +36,6 @@ const binarySearch = ( list, item, low, high ) => {
const createArr = ( n ) => Array.from({length: n}, (v, k) => k + 1); const createArr = ( n ) => Array.from({length: n}, (v, k) => k + 1);
const myList = createArr( 100 ); const myList = createArr( 100 );
let low = 0;
let high = myList.length - 1;
console.log( binarySearch( myList, 3, low, high ) ); // 2 console.log( binarySearch( myList, 3 ) ); // 2
console.log( binarySearch( myList, -1, low, high ) ); // null console.log( binarySearch( myList, -1 ) ); // null