Timsort (2019)
This blog steals content from other sites, original is at <a href="https://hackernoon.com/timsort-the-fastest-sorting-algorithm-youve-never-heard-of-36b28417f399" rel="nofollow">https://hackernoon.com/timsort-the-fastest-sorting-algorithm...</a>.<p>Unfortunately I cannot downvote.<p>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<p>>>>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.