Programming Algorithms in Lisp: Writing Efficient Programs with Examples in ANSI Common Lisp

© Vsevolod Domkin 2021

V. DomkinProgramming Algorithms in Lisphttps://doi.org/10.1007/978-1-4842-6428-7_6

6. Linked Lists

Vsevolod Domkin¹  

(1)

Kyiv, Ukraine

 

Linked data structures are in many ways the opposite of the contiguous ones that we have explored to some extent in the previous chapter using the example of arrays. In terms of complexity, they fail where those ones shine (first of all, at random access), but prevail at scenarios when a repeated modification is necessary. In general, they are much more flexible and so allow the programmer to represent almost any kind of a data structure, although the ones that require such level of flexibility ...