Python uses TimSort, a new algorithm developed by Tim Peters.
It is a O(NlogN) sorting algorithm, yes, both for the worst and average cases. In ideal situations it improves to O(N). See the Python Wiki Time Complexity page and the Wikipedia article I linked you to.
Note that the algorithm has proven quite popular and it has been added to Java SE 7, Android, and GNU Octave as well.
