Hacker News new | ask | show | jobs
by stralep 5359 days ago
If ordering is made by color&design, matching drops to O(n log(n)).

Again, with ordering, searching drops to O(log n)

1 comments

However, that actually requires ordering socks, which as we all know is O(not gonna happen).