Question

i need to understand the right way to compair a binary search with string match in the same input value in JavaScript

Answer 1

Binary Search in Javascript:

Binary Search is glancing through procedure which manages Divide and Conquer approach. It used to glance through any part in a masterminded bunch.Binary search is much faster with Time Complexity of O(logN).

Code:

var a = [6,5,1,2,3,7,9,4,8];

a.sort(function (x, y) {
return x - y;
});

console.log('Array', a);

function binarySearch(ar, i) {
var mid = Math.floor(ar.length / 2);
console.log(ar[mid], i);

if (ar[mid] === i) {
console.log('match', ar[mid], i);
return ar[mid];
} else if (ar[mid] < i && ar.length > 1) {
console.log('mid lower', ar[mid], i);
binarySearch(ar.splice(mid, Number.MAX_VALUE), i);
} else if (ar[mid] > i && ar.length > 1) {
console.log('mid higher', ar[mid], i);
binarySearch(ar.splice(0, mid), i);
} else {
console.log('Not found', i);
return -1;
}

}
var res = binarySearch(a, 100);
console.log(res);