And that makes a lot of algorithms more convenient, because

sometimes you want to stop and you want to back up, and you

don't want to have to always be starting at the beginning of

an array,( no eh, ) excuse me, the beginning of a list.

So, the list is very good for operations like insertion and deletion.

It's not so good when

you have to get to an element that's somewhere

deep in the list because that's an order-n O(n) computation.

For a vector this is an order one O(1) {constant time} computation,

which is very efficient to look up the nth element.

(<vector> Dominate s <list> for lookup.)

So, vectors tend to dominate in the general world of

data processing because you have this ability to random access.

But lists have very important uses where you

need to not only expand but possibly shrink.

And insert and you have a fair amount

of insertion and deletion and then the balance is tipped.

The efficiency balance is tipped from vector to list.

And more complex computations, truthfully, will use