Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Why do some collection data structures not maintain the order of insertion? What is the special thing achieved compared to maintaining order of insertion?
Do we gain something if we don’t maintain the order?
Performance. If you want the original insertion order there are the
LinkedXXXclasses, which maintain an additional linked list in insertion order. Most of the time you don’t care, so you use aHashXXX, or you want a natural order, so you useTreeXXX.In either of those cases why should you pay the extra cost of the linked list?