Open ethanboyuan opened 10 years ago
I have a doubt about the complexity of the recursive method. This should not be n^6. The worst case should be 6^n instead of n^6.
Well, I'll take a look at it
The time complexity for dynamic programming should be O(n^4).
I have a doubt about the complexity of the recursive method. This should not be n^6. The worst case should be 6^n instead of n^6.