Sign in to follow this  

Efficiency for various data structures

This topic is 4336 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Is there a website or someplace I can go to that has some type of library of big-O notations for aspects of a LOT of different data types? For instance, big-O notation for insertion at the front of a list for a singly-linked list, a doubly linked list, a stack, a queue, etc. Also, insertion at the back, deletion from the front, deletion from the back, deletion by index, etc. for all those same data types, and more. Basically, some kind of huge big-O notation table to compare and contrast the advantages and disadvantages of various data types.

Share this post


Link to post
Share on other sites
A lot of those details are implementation specific even for the same kind of data structure. For example, length of a list could be O(n) or O(1) depending on the implementation. Pushing an element on one stack implementation could be O(1) average amortized, but O(n) worst case, and always O(1) for another implementation.

Share this post


Link to post
Share on other sites

This topic is 4336 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this