- Binary Search
Binary Search is an efficient algorithm for finding an element in a sorted array by repeatedly dividing the search interval in half.What you will be learning in this course??
O(log n) Time
Extremely fast search on sorted data.
Sorted Input
Requires monotonic or sorted input.
Lower & Upper Bound
Finding first or last occurrence.
Search Space Reduction
Halving search space each step.
Variants
Binary search on answer, rotated arrays, etc.
