Groups
Category
Binary search quickly finds targets or boundaries in sorted or monotonic data by halving the search interval each step.
A dynamic segment tree stores values over a huge coordinate range by creating nodes only when an operation touches their interval.