Heap sort algorithm is very efficient and costs O(log(n)) time complexity. Here is an implementation in Python.