[dktalks]

This blog steals content from other sites, original is at https://hackernoon.com/timsort-the-fastest-sorting-algorithm....

Unfortunately I cannot downvote.

Please don't link plagiarized content. This guy also linked to his own "Big O Notation" in his page, where he says O(n) is polynomial

>>>In our shopping list example, in the worst-case of our algorithm it prints out every item in the list sequentially. Since there are n items in the list, it takes O(n) polynomial time to complete the algorithm.

[indigo945]

This may be the same author ... Anyway f(n)=n is definitely a polynomial and O(n) is a class of algorithms that run in polynomial time (i.e. are in P).

[caslon]

It's the same author; compare the URL to your link's author's last name.

[thebooktocome]

Well, linear functions are still technically polynomials… haha!

[rat9988]

O(n) is polynomial and it's the same author.

[TameAntelope]

There are no downvotes on submissions, FWIW.