Whenever you need random access you use something else. If all you need is sequential access, there are lots of optimizations that can be done to the representa

Whenever you need random access you use something else. If all you need is sequential access, there are lots of optimizations that can be done to the representation of lists that make them more efficient. In guile scheme you gain very little by using vectors instead of lists unless you want random access. There is however a never-ending flood of people coming from python using lists in exciting ways to create accidentally O(n^3) programs :) Those can almost always be re-written to be o(n) using linked lists, otherwise you point them to vectors instead.