Binary Search

(function () {
 
	// must be sorted array.
	var aList       = [2, 6, 9, 32, 33, 45, 47, 65];
 
		nElemToFind = 6,
		nMinRange   = 0,
		nMaxRange   = aList.length-1,
		bResult     = false;
 
		while (nMinRange <= nMaxRange)
		{
			var nMid = Math.floor((nMinRange + nMaxRange) / 2);
 
			if (nElemToFind === aList[nMid]) {
				bResult = true;
				console.log(bResult);
				return;
			}
			else if (aList[nMid] > nElemToFind) {
				nMaxRange = nMid-1;
			}
			else if (aList[nMid] < nElemToFind) {
				nMinRange = nMid+1;
			}
		}
		console.log(bResult)
 
})();