mirror of
https://github.com/SerenityOS/serenity
synced 2026-05-14 10:56:35 +02:00
The algorithm I came up with is O(n^2) but given the small numbers of rects we're typically working with, it doesn't really matter. May need to revisit this in the future if we find ourselves with a huge number of rects.
488 B
488 B