- Joined
- Aug 7, 2013
- Messages
- 1,338
Hi,
I thought I read something before about recursion being slow in JASS (or risking breaking the map) but would just like to make sure there's nothing wrong with it.
The recursive function(s) I am thinking of using would have calls equal to the size of the problem set (O(n)) and the average size would be around 3-10...
I thought I read something before about recursion being slow in JASS (or risking breaking the map) but would just like to make sure there's nothing wrong with it.
The recursive function(s) I am thinking of using would have calls equal to the size of the problem set (O(n)) and the average size would be around 3-10...