If ordering is made by color&design, matching drops to O(n log(n)). Again, w... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		stralep on Oct 12, 2011 \| parent \| context \| favorite \| on: Steve Jobs Book Excerpt: Why he wore the black moc... If ordering is made by color&design, matching drops to O(n log(n)). Again, with ordering, searching drops to O(log n)

sid0 on Oct 12, 2011 [–]

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

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