Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey) [article]

Paul M.B. Vitanyi
2009 arXiv   pre-print
Recently, many results on the computational complexity of sorting algorithms were obtained using Kolmogorov complexity (the incompressibility method). Especially, the usually hard average-case analysis is ammenable to this method. Here we survey such results about Bubblesort, Heapsort, Shellsort, Dobosiewicz-sort, Shakersort, and sorting with stacks and queues in sequential or parallel mode. Especially in the case of Shellsort the uses of Kolmogorov complexity surprisingly easily resolved
more » ... ms that had stayed open for a long time despite strenuous attacks.
arXiv:0905.4452v1 fatcat:amug6iugczdb3b65kxjrxuemwu