Question about linked implementation

[bdario1]

Assume you have a container, and you must be able to quickly access data in the container in any order you want. Would an array-based implementation or a linked implementation be better? Why?

[Fubarable]

Sometimes a hash (such as a HashMap would be better). But given your two choices, which do you think would be better, and then let's discuss it. :)

[bdario1]

Well I think linked implementation would be better since you can do like list.add or remove or get indexOf size() to the List ADT - and things like that to it.

[Fubarable]

Think of how you'd access random items on a linked list -- starting at the head and then walking through the list til you reach the item of interest, vs how you'd access a random item in an array -- get an index and then use it to scoop up the item of interest.

[bdario1]

So basically array seems to be better right? it seems faster since you can check left and right of the index and move the way you want and keep doing it until you get to your desired location. As with list you would have to go through every element before you get to it right?

[j2me64]

So basically array seems to be better right? it seems faster since you can check left and right of the index and move the way you want and keep doing it until you get to your desired location. As with list you would have to go through every element before you get to it right?

can you please tell how many elements you will have in your array?