Analyzing variants of Shellsort

Analyzing variants of Shellsort

We consider two variants of Shellsort — Dobosiewicz sort and Shaker sort. Not much is known about the running time of these algorithms. We prove that the worst-case time of Shaker sort is O(n 3/2 log 3n) for certain sequences of increments and the average-case time for both variants is Ω(n 2/c p) wh...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2001-09, Vol.79 (5), p.223-227
1. Verfasser: BREJOVA, Bronislava
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Algorithms
Analysis of algorithms
Applied sciences
Automata. Abstract machines. Turing machines
Computer science
control theory
systems
Exact sciences and technology
Information processing
Information systems. Data bases
Kolmogorov complexity
Memory organisation. Data processing
Software
Sorting
Studies
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider two variants of Shellsort — Dobosiewicz sort and Shaker sort. Not much is known about the running time of these algorithms. We prove that the worst-case time of Shaker sort is O(n 3/2 log 3n) for certain sequences of increments and the average-case time for both variants is Ω(n 2/c p) where p is the number of increments and c=2 for Dobosiewicz sort and c=4 for Shaker sort. In our proofs we adapt techniques and results from analysis of Shellsort.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(00)00223-4