Binary Search repeatedly divides sorted search spaces in half, reducing time complexity from O(N) to O(log N). Learn how to search discrete arrays, rotated arrays, and continuous solution answer spaces.
Monotonic Invariant Property: The search range must be sorted or exhibit a monotonic true/false condition.
Overflow Safety: Calculate mid using 'low + (high - low) / 2' instead of '(low + high) / 2'.
Binary Search on Answer Space: When minimizing maximums, binary search over possible solution values.
Rotated Sorted Arrays: Detect sorted half to determine which side to shrink.