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

Bubble sort algorithm costs 'O(n*n)' time complexity. Here is an implementation in Python.

Quick sort algorithm also costs O(n\*n) time complexity. It uses a divide and conquer approach - it keeps partitioning and sorting those partitions until done. Here is an implementation in Python.