algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-07 02:05:08 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #9 from ms10398/master

Browse Source 
Added Implementation of Binary Search
This commit is contained in:
Anup Kumar Panwar
2017-08-18 16:07:00 +05:30
committed by GitHub
parent dfc54ba8d6 9bccfacb0d
commit 7c11bde4a2
1 changed files with 27 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
Search/binarySearch.js Normal file
View File

@ -0,0 +1,27 @@
/*Binary Search-Search a sorted array by repeatedly dividing the search interval
* in half. Begin with an interval covering the whole array. If the value of the
* search key is less than the item in the middle of the interval, narrow the interval
* to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the
* value is found or the interval is empty.
*/
function binarySearch(arr, i) {
var mid = Math.floor(arr.length / 2);
if (arr[mid] === i) {
console.log('match', arr[mid], i);
return arr[mid];
} else if (arr[mid] < i && arr.length > 1) {
binarySearch(arr.splice(mid, Number.MAX_VALUE), i);
} else if (arr[mid] > i && arr.length > 1) {
binarySearch(arr.splice(0, mid), i);
} else {
console.log('not found', i);
return -1;
}
}
var ar=[1,2,3,4,5,6,7,8,9,10];
binarySearch(ar,3);
binarySearch(ar,7);
binarySearch(ar,13);