Re:Sort, sweep, and prune: Collision detection algorithms
by yeevs on Wednesday August 14, 2024 @08:50AM
(#41245485)
it's the summation of numbers from 1 to n which is n(n+1)/2. This reduces to quadratic complexity because big O notation ignores all coefficients and terms that scale slower
[ Parent
| on HN ]
There are no comments on this comment yet.