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

Implement Deque as ArrayDeque (experiment) #9

Open
vitkarpov opened this issue May 28, 2019 · 0 comments
Open

Implement Deque as ArrayDeque (experiment) #9

vitkarpov opened this issue May 28, 2019 · 0 comments
Labels
deque enhancement New feature or request

Comments

@vitkarpov
Copy link
Owner

vitkarpov commented May 28, 2019 •
edited
Loading

Probably It'd be faster with an array (Pls, check out this thread → https://twitter.com/vitkarpov/status/1133342188253978624)

Requirements

The complexity (efficiency) of common operations on deques is as follows:

Random access - constant O(1)
Insertion or removal of elements at the end or beginning - constant O(1)
Insertion or removal of elements - linear O(n)
@vitkarpov vitkarpov self-assigned this May 28, 2019
@vitkarpov vitkarpov changed the title Reimplement as array Reimplement with an array (ArrayDeque) May 28, 2019
@vitkarpov vitkarpov mentioned this issue May 28, 2019
Closed
2 tasks
@vitkarpov vitkarpov removed their assignment Dec 10, 2019
@vitkarpov vitkarpov added the enhancement New feature or request label Dec 10, 2019
@vitkarpov vitkarpov changed the title Reimplement with an array (ArrayDeque) Implement Deque as ArrayDeque (experiment) Dec 10, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
deque enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

Reimplement with an array (ArrayDeque) vitkarpov/stljs
1 participant
@vitkarpov