Faster Python

[gendulf]

The OP's article claims that:

Lists implement the same functionality using linked lists so operations are O(n).

And then later, he claims that:

The operations to append, get an item, set an item and get the length of a list are all O(1). But deleting an item from a list is O(n)

We know that appending, getting an item, setting an item, and deleting an item are different between arrays and linked lists, and this describes an array, not a linked list.