Smoothsort
The Smoothsort algorithm for sorting an array of permuted values.
The smoothsort - sorting method is a variation of heapsort which of Edsger W. Dijkstra was developed 1,981th The advantage is that, in the best case , the effort required for pre-sorted episodes is sufficient. However, due to its complexity, it is rarely used. This is due to the fact that in the worst-case and average-case with a runtime of no improvement over the heapsort algorithm .
