CyberLogic Academy

Curriculum Labs Community

CS MODULE CURRICULUM

Logic Foundations

Overview Curriculum Labs

Modules

Documentation Support

Binary Search .divide_and_conquer

Logarithmic search in a sorted structure

Speed: 800ms

Computations

0

Mid (Target)

Active Bounds

Found

Left (L)

0

Mid (M)

—

Right (R)

0

Step: 1 / 0

0% Complete

BINARY_SEARCH.JS

function binarySearch(array, target) {
    let left = 0;
    let right = array.length - 1;

    while (left <= right) {
        const mid = Math.floor((left + right) / 2);
        const currentValue = array[mid];

        if (currentValue === target) {
            return mid; // Found
        }

        if (currentValue < target) {
            left = mid + 1; // Search right half
        } else {
            right = mid - 1; // Search left half
        }
    }

    return -1; // Not found
}

Complexity AnalysisO(log n)

Time: O(log n)Space: O(1)

Pro Tip

Binary search drastically reduces the search space by halving it at each step. Because the array is sorted, we can safely eliminate 50% of the dataset in O(1) time.

Algorithm Status

Initializing binary search...

Looking For: