3 ms·
Computing Shortest Path in O(1) time
- meursault334 11y agoIs this actually O(1)? Because the electricity has to to travel the shortest path it seems like it is at best O(shortest path length). The constant factor is of course very small.
- 8note 11y agoif you have to wire thousands of LEDs, it will take significantly longer to setup the problem, and I think that should factor into the time complexity