News for hackers. Stuff that matters.

A comment on Sort, sweep, and prune: Collision detection algorithms. Parent comment

Re:Sort, sweep, and prune: Collision detection algorithms by chipdart on Wednesday August 14, 2024 @01:26PM (#41248430)
> (...) but as "describing how performance changes as the size of the input data increases".

Yes, that's the definition of asymptotic computational complexity. That's the whole point of these comparisons. It's pointless to compare algorithms when input size is in the single digit scale.

[ Parent | on HN ]
Re:Sort, sweep, and prune: Collision detection algorithms by Kubuxu on Wednesday August 14, 2024 @02:51PM (#41249302)
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.
[ Parent | on HN ]