Hacker News new | comments | show | ask | jobs | submit login

If ordering is made by color&design, matching drops to O(n log(n)).

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

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

Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | Legal | Apply to YC | Contact