Trees & SearchD1Phase 1sorted-arraydivide-and-conquerbounds

Binary Search

Low-level search baseline illustrating midpoint decision boundaries.

Easy Explanation

Binary Search checks the middle of a sorted list and discards half each step until it finds the target.

Renderer Mode

`Simple` uses abstract, short-form-friendly visuals. `Advanced` keeps the current detailed view.

Arrays + Grid

Visualizer

O(log n)Binary Search

Deterministic search playback with active bounds, midpoint, and completion state.

Target

n/a

Low / High

0 / -1

Mid

n/a

Result

Searching

Ready

Press Play or Step to start execution.

No values available for visualization.

Parameters

Placeholder

Parameter schema and validation are enabled for Binary Search, BFS, Bidirectional BFS, DFS, Dijkstra, A*, Bubble Sort, Quick Sort, Heap Sort, Topological Sort, Union-Find, Kruskal MST, Prim MST, Bellman-Ford, BST Operations, AVL Rotations, Selection Sort, Counting Sort, Insertion Sort, Merge Sort, Invert Binary Tree, and Trie Operations in this milestone.

Other algorithms keep scaffolded controls until their engines are implemented.

Complexity

Param Aware

Time and space complexity with current-run context derived from normalized params and input size.

Best Time

O(1)

Average Time

O(log n)

Worst Time

O(log n)

Space

O(1)

Current Run

Awaiting run output

n = 0

Current behavior: O(log n)

Worst-case iteration bound for n: 0

Result: pending

Complexity updates when params regenerate the deterministic run.

Binary Search Implementation

Pseudocode + TypeScript

Reference implementation examples are intentionally abstracted from the playback engine so learners can map concepts to code.

pseudocode

function binarySearch(values, target):
  low <- 0
  high <- length(values) - 1

  while low <= high:
    mid <- low + floor((high - low) / 2)

    if values[mid] == target:
      return mid

    if values[mid] < target:
      low <- mid + 1
    else:
      high <- mid - 1

  return -1

1.00xNo Run