Welcome to the algorithm wiki!

• insertion-sort; merge-sort; quicksort; heapsort are all comparison sorts, i.e. they are doing elements comparison. any comparison sorts has a lower bound Ω(nlgn) on the worst-case running time.