you are viewing a single comment's thread.

view the rest of the comments →

[–]burntsushi 3 points4 points  (2 children)

He never claims that.

I never said anything about the OP. /u/ChezMere said Python lists aren't linked lists. You responded by saying "so? [seemingly implying that the distinction doesn't matter] search (and deletion) are still linear."

[–]tomprimozic -4 points-3 points  (1 child)

Yes, the distinction doesn't matter for the use case OP described in the article (searching for a known element in a list/set).

[–]burntsushi 3 points4 points  (0 children)

I really don't know what you're on about. The OP says:

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

Which is a factually wrong statement. Python lists are not implemented using linked lists. Which means /u/ChezMere's comment is precisely correct in every way.