Too Long; Didn't ReadTimsort: A very fast , O(n log n), stable sorting algorithm built for the real world — not constructed in academia. Photo by Marc Sendra martorell on Unsplash Timsort: A very fast , O(n log n), stable sorting algorithm built for the real world — not constructed in academia. Click here to view the updated article: Timsort - the fastest sorting algorithm you've never heard
![Timsort — the fastest sorting algorithm you’ve never heard of | HackerNoon](https://cdn-ak-scissors.b.st-hatena.com/image/square/2a134c83d1521602880197c0b878d157e3857450/height=288;version=1;width=512/https%3A%2F%2Fhackernoon.imgix.net%2Ffallback-feat.png)