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.
Over the past few years I’ve had to delve deeper into Spring’s source. I’ve noticed that the developers really like linked lists.I’m not sure why they chose this as their list implementation over array list. Does anyone know why the made this deferment decision?
It really depends on the usage. But perhaps it is because the space complexity when growing a Linked Lists is cheap, and if you are just iterating over a collection you don’t do any find operations it is a good choice. Recall ArrayList implementation has a geometric growth model and is a bad choice if you don’t know apriori how large the list will be. Growing the list past the current capacity will cause the current array to get copied to a new array of twice the current capacity.