Sort in O(N) – linear complexity!

Computer Sciences taught you the best time complexity to sort N elements is O(NLogN)? That’s a lie! I’ll show you how to do it in linear complexity! Brace yourself. I love algorithms and this sort of tricks helped me achieve best-in-class performance on embedded devices and for financial applications.