I came across this blog post while revising my old lecture notes on data structures for a class I am teaching this semester (applied computational science).
The "provocative" claim is that arrays often do better in practice than linked-lists for insertion and deletion of random elements, so long as the elements are "small".
As you would expect, there is a very lively comment section.
Worth a read.
The "provocative" claim is that arrays often do better in practice than linked-lists for insertion and deletion of random elements, so long as the elements are "small".
As you would expect, there is a very lively comment section.
Worth a read.
No comments:
Post a Comment