Jump to content
  • Advertisement
Sign in to follow this  
BTownTKD

Efficiency for various data structures

This topic is 4673 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
Advertisement
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
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!