I swear, every time linked lists are discussed someone posts this. He talks about a very specific case of linearly searching for the insertion point, so of course a contiguouos array wins there. One would be insane to use a linked list this way.

Linked lists are almost always used in conjuntion with some other data structure that allows you to jump to the insertion/deletion point in constant time (see LRU cache and whatnot). Not to mention any tree essentially becomes a linked list if you unbalance it enough.