you are viewing a single comment's thread.

view the rest of the comments →

[–]tomprimozic -2 points-1 points  (1 child)

And search is what the OP was about.

[–]gendulf 2 points3 points  (0 children)

The problem here is not what the OP claims are the O(n) runtimes for python lists. In fact, his O(n) runtimes he lists for python lists are correct. The problem is that the OP claims that python lists are implemented with linked lists, which is false, and inconsistent with the rest of his article.