iframe-proxy | Sunbelt Computer Software

This repository was archived by the owner on Sep 7, 2025. It is now read-only.

32 lines (25 loc) · 731 Bytes

// JavaScript implementation of Binary Search
// Author: Niezwan Abdul Wahid
// Binary Search only applicable to a sorted array
let arrayOfItems = [1, 3, 5, 7, 9, 11, 13, 15, 16, 19, 22];
function binarySearch(arrayOfItems, itemToFind) {
	let low = 0;
	let high = arrayOfItems.length - 1;
	let mid, pointer;
	while(low <= high) {
	    mid = Math.floor((low + high) / 2),
	    pointer = arrayOfItems[mid];
	    if(pointer === itemToFind) {
                console.log('Found ' + pointer + " at index " + mid);
		    return;
	    if(itemToFind < pointer) {
	        high = mid - 1;
            } else {
	        low = mid + 1;
	console.log("Item not found");
	return null;
binarySearch(arrayOfItems, 7);

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

binarySearch.js

Latest commit

History

binarySearch.js

File metadata and controls