Hi All! If you are interested in sorting algorithms, you will learn something new: 1. It's commonly believed that, on average, comparison sorting can't perform better than O(N log(N)).
Source: [Hacker News](https://news.ycombinator.com/item?id=49314420)