4 ms·
> handle a linked list as rapidly as the JVM handles an array A linked list is not an array. Particular operations will have different complexities. One data s
by dons 12y ago
> handle a linked list as rapidly as the JVM handles an array
A linked list is not an array. Particular operations will have different complexities. One data structure is not "more rapid" than another.
- kasey_junk 12y agoThis is precisely the kind of thinking people need to be careful about. Some data structures are more rapid than others even with more complex operations, because they conform to the reality of the underlying hardware better.
- codygman 12y agoCan you please provide some examples? It would be much appreciated.
- noblethrasher 12y agohttp://youtu.be/YQs6IC-vgmo http://youtu.be/YQs6IC-vgmo Stroustrup describes why –on modern hardware– vectors are faster than linked list for insertion and deletion.