What are some biggest improvements with respect to computational complexity of algorithms (like: O(n)->O(log n)) in history of computer science?
Will there be any sorting algorithm of complexity less than O(n log n) ?