3 ms·
That’s an O(n) car key search, if you instead asked the question “are my car keys in this half of the house?” you could perform a binary search O(log n).
by jahewson 6y ago
That’s an O(n) car key search, if you instead asked the question “are my car keys in this half of the house?” you could perform a binary search O(log n).
- ineedasername 6y agoI would still need N sites to ultimately resolve the specific room the keys are located it, and it would complicated my RSS feed because more than one would resolve to "yes". No, each room in my house must have its own sue & domain. Actually I would need more sites under that method: an 8 room house would need a site for each side of the 4/4 split, then another for each 2/2 split, then 1 for each room.