Array Techniques Visualization

interactive Binary Search · Two Pointers · Sliding Window

Algorithm Notes

Summary: Repeatedly halve search interval in sorted data.
Time: O(log n)
Space: O(1) iterative, O(log n) recursive
Requires: Monotonic/sorted sequence, random access preferred.

Big-O Guide

Ready