Timsort: The Fastest sorting algorithm for real-world problems.

Awdesh on August 14, 2018

Timsort was implemented by Tim Peters in 2002, it has been a standard sorting algorithm for Python since Python 2.3. Python's sorted and list. so... [Read Full]
markdown guide

I wouldn't normally comment on these things, but I followed this link (hackernoon.com/timsort-the-fastest...) posted by Michael Kohl in the comments and... I'll be blunt and say this is just a slightly modified copy of that article (even the section headings are the same!). If you want a better and more honest read, follow the link and skip this article.

Awdesh, please don't just copy random articles on the web and post them as your own.


Wow. Thanks for your feedback Rui Rei.

I don't know which part of the article you think is copied. A considerable amount of time being spent on understanding this algorithm from original python and Java docs (referenced) hence different hand drawn diagram.

Original article that is referenced uses similar section headings to keep concepts segregated.


TQ, a great post. Need to revisit a few times to get a hang of it.


Thank you. Yeah, there's a lot of information to digest in this algorithm.


In above example, Binary insertion sort requires 2 iterations to find a location to insert 8.

I think it should requires 3 iterations.

  1. 0-7, mid=3
  2. 0-3, mid=1
  3. 1-3, mid=2
code of conduct - report abuse