Adaptive sorting: an information theoretic perspective

We present two algorithms that are near optimal with respect to the number of inversions present in the input. One of the algorithms is a variation of insertion sort, and the other is a variation of merge sort. The number of comparisons performed by our algorithms, on an input sequence of length n t...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Acta informatica 2008-02, Vol.45 (1), p.33-42
Hauptverfasser:	Elmasry, Amr, Fredman, Michael L.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science control theory systems Computer Systems Organization and Communication Networks Data processing. List processing. Character string processing Data Structures and Information Theory Exact sciences and technology Information Systems and Communication Service Logics and Meanings of Programs Mathematical analysis Memory organisation. Data processing Miscellaneous Original Article Software Software Engineering/Programming and Operating Systems Studies Theoretical computing Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!