New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Scramble string complexity #35

Open

ethanboyuan opened this issue Nov 7, 2014 · 2 comments

ethanboyuan commented Nov 7, 2014

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.

Owner

soulmachine commented Nov 7, 2014

Well, I'll take a look at it

hqztrue commented Jul 29, 2020

The time complexity for dynamic programming should be O(n^4).

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment