Is it possible to sort an array faster than O(n*log(n)) time?

Too Long; Didn't Read

Possibly this question arises in the mind of every person who have once come across the subject of <strong>Design and Analysis of Algorithms. </strong>Generally we assume that the best time possible to sort an n element array is O(n*log(n)) and it turns out that this assumption can be proved as well.