Algorithm for hit test in non-overlapping rectangles

Question

I have a collection of non-overlapping rectangles that cover an enclosing rectangle. What is the best way to find the containing rectangle for a mouse click?

The obv

Answer 1

Shove them in a quadtree.