The impression I got is that the overall algorithm requires O(n) qsorts and O(n^... | Hacker News

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

caf on March 17, 2012 | parent | context | favorite | on: Why we didn't use a bloom filter

The impression I got is that the overall algorithm requires O(n) qsorts and O(n^2) intersections, so the speed of the sorting is not important.

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