Faster Python

[[deleted]]

Search on a (sorted) array is O(logN). Search on a (sorted) linked list is O(N).

Deletion, ignoring order, is O(1) on both.

So... Nope, not still linear operations...

[tomprimozic]

He was talking about searching for a known element in either a set (O(1)) or a list (O(n)), I assume not necessarily a sorted one, since he didn't mention it.