In the RHE book the below reference is made under Summary of Collections: Using a tree supports insertion, deletion, and growing the list, indexed access is slow, but searching is faster. What does it mean when it refers to indexed access? I didn't understand " indexed access is slow, but searching is faster". Could someone explain. Thanks in advance.
If I want to get at the Nth element in the collection I can make a call directly to it (without having to "walk the elements" until I get to it). They are saying getting directly at a specific index is slower than some other collection implementations, but if your need is for searching for a particular value in one of the elements this is a good choice.
"JavaRanch, where the deer and the Certified play" - David O'Meara