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

State asymptotic running times #7

Open
noinia opened this issue Jan 7, 2015 · 1 comment
Open

State asymptotic running times #7

noinia opened this issue Jan 7, 2015 · 1 comment

Comments

@noinia
Copy link

noinia commented Jan 7, 2015

It would be great if you could mention asymptotic running times. I briefly scanned through the code, seems like most should be what you expect, (i.e. O(1) amortized for a single rotate/insert) or O(n) for full traversels. The only exceptions are removeL and removeR, Alternatingly calling removeL and removeR looks like that is going to be expensive (i.e. linear time per operation)?
@jeremyjh
Copy link
Collaborator

jeremyjh commented Mar 7, 2016

Sorry I never responded, I would take a PR for this.

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
2 participants
@jeremyjh @noinia