Analysis of information sources in references of the Wikipedia article "Smoothsort" in English language version.
Smoothsort is not stable, and stability is often more desirable than in-place in practice
One can also raise the question why I have not chosen as available stretch lengths: ... 63 31 15 7 3 1 which seems attractive since each stretch can then be viewed as the postorder traversal of a balanced binary tree. In addition, the recurrence relation would be simpler. But I know why I chose the Leonardo numbers:(transcription)
