Smoothsort

The Smoothsort - sorting method is a variation of heapsort, which was developed by Edsger W. Dijkstra in 1981. The advantage is that it manages in the best-case at a cost of at presorted consequences. Due to the complexity of it is seldom used. This is because it brings no improvement in the running time compared to the heapsort algorithm in the worst-case and average-case.