Toot

Written by Felyashono on 2024-12-06 at 23:07

@teotwaki

I suspect you just hit on a key optimization I hadn't bothered to apply: you use a hashmap for the locations of the obstacles. I use an array. I expect obstacles.contains(point-in-front-of-me) to run in O(n) where n is the number of obstacles. You expect it in O(1).

=> More informations about this toot | View the thread | More toots from felyashono@disabled.social

Mentions

=> View teotwaki@mastodon.online profile

Tags