Skip to content
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

O(n^2) time complexity due to list copy #5

Open
IgSaf opened this issue Jan 6, 2021 · 0 comments
Open

O(n^2) time complexity due to list copy #5

IgSaf opened this issue Jan 6, 2021 · 0 comments

Comments

@IgSaf
Copy link

IgSaf commented Jan 6, 2021

There is a copy of list in unfold function. It leads to O(len(remains)) time complexity for this operation. And due to being inside while remainder > 0 this gains O(n^2) time complexity for the whole implementation (e.g. for "aaaaab").
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@IgSaf