| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
feat(collision): speed up collision detection
|
i'm curious how did you compute the complexity ? @Miou-zora |
Sorry, something went wrong.
There was a problem hiding this comment.
lgtm
Sorry, something went wrong.
it's basically a double for loop (O(n²)) which I cut in half because a collide with b is the same as b collide with a. (It's more like O(n²/2 - n/2) but n/2 is negligeable) |
Sorry, something went wrong.
| Back | FazBrowse Home | New Git URL |
Linked to:
I've added a dumb collision detector using a O(n²/2) algorithm