Topics

1

General discussions / Algorithmic complexity of sf::Rect::intersects

« on: April 11, 2020, 05:10:04 pm »

I'm writing up some collision detection code, and I want to know how well it's going to scale. If every object in the scene needs to check for a collision with every other object in the scene, that's going to be O(n^2) calls to  intersects (where n = number of objects). How much does it take per intesection?