You could have an O(N^2) algorithm outperform an O(N) on the scale of 10,000 (or...

Kubuxu 5 months ago | parent | context | favorite | on: Sort, sweep, and prune: Collision detection algori...

You could have an O(N^2) algorithm outperform an O(N) on the scale of 10,000 (or whatever scale you want to imagine). The big-O notation compares only asymptotic behaviour, and sometimes the lower power factors are overwhelming.