# Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey)

```@article{Vitnyi2009AnalysisOS,
title={Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey)},
author={Paul M. B. Vit{\'a}nyi},
journal={ArXiv},
year={2009},
volume={abs/0905.4452}
}```
• P. Vitányi
• Published 27 May 2009
• Mathematics, Computer Science
• ArXiv
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, Dobosiewiczsort, 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… Expand
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
• Mathematics, Computer Science
• Inf. Process. Lett.
• 2007
A simple incompressibility argument is obtained that yields an asymptotic analysis of the average height of a Binary Insertion Tree, which implies that the QuickSort algorithm sorts a permutation of n elements in @Q(nlgn) comparisons on average. Expand
The Folklore of Sorting Algorithms
• Mathematics
• 2009
The objective of this paper is to review the folklore knowledge seen in research work devoted on synthesis, optimization, and effectiveness of various sorting algorithms. We will examine sortingExpand
Encoding Arguments
• Computer Science, Mathematics
• ACM Comput. Surv.
• 2017
“Encoding arguments” provide an alternative presentation in which probabilistic reasoning is encapsulated in a “uniform encoding lemma” that provides an upper bound on the probability of an event using the fact that a uniformly random choice from a set of size n cannot be encoded with fewer than log 2n bits on average. Expand
Enhancement of Selection, Bubble and Insertion Sorting Algorithm
• Computer Science
• 2014
A set of improved sorting algorithms are proposed which gives better performance and design idea and are analyzed using asymptotic analysis and also using machine-running time and compared with their basic sorting algorithms. Expand
SIGACT News Complexity Theory Column 90
We discuss research developments on the complexity of shortest programs since the turn of the millennium. In particular, we will delve into the phenomenon of list approximation: while it’s impossibleExpand
A Brief on Short Descriptions
• Mathematics, Computer Science
• SIGA
• 2016
The phenomenon of list approximation is delved into: while it's impossible to compute the shortest description for a given string, the authors can efficiently generate a short list of candidates which includes a (nearly) shortest description. Expand
Demonstration of Sorting Algorithms on Mobile Platforms
This paper presents a systematic approach to the implementation of a mobile framework for demonstrating of sorting algorithms, and implementations of Gnome Sort, Insertion Sort, and Quicksort are given as a portable C-style code. Expand
Bounded Rationality and the Emergence of Simplicity Amidst Complexity
The purpose of this essay is to explore the relationship between the simple and the complex in economics by anchoring our analysis on bounded rationality. Much of the conventional literature focusesExpand
A C++ App for Demonstration of Sorting Algorithms on Mobile Platforms
• Computer Science
• Int. J. Interact. Mob. Technol.
• 2014
This paper presents a systematic approach for designing a C++ app for demonstrating sorting algorithms on smartphones and tablets and the implementation of Insertion Sort is given as an example. Expand
Enterprises as Complex Systems: Extended Axiomatic Design Theory and its Application in Enterprise Architecture Practice
• Engineering
• 2014
The concept of self-evolving/self-designing systems is defined using the notion of life cycle relationships. The authors propose that to design complex enterprises as systems of systems on each levelExpand