Bad cases for shaker-sort
type: Item
instance of: scholarly article
title: Bad cases for shaker-sort
zbMATH Open document ID: 0662.68065
DOI: 10.1016/0020-0190(88)90158-5
author: Mark Allen Weiss
author: Robert Sedgewick
published in: Information Processing Letters
publication date: 1988-01-01T00:00:00Z
review text: It is shown, by example, that shaker-sort is quadratic in the worst case for the specific increments suggested by its authors, Incerpi and Sedgewick, and that simple variations of these increment sequences do not do significantly better. At the same time, shaker-sort does not seem to be significantly faster than shell-sort for any file size, especially when good increment sequences are used for shell-sort.
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 4082996
zbMATH Keywords: sorting
zbMATH Keywords: shaker-sort
zbMATH Keywords: shell-sort
reviewed by: Dan Grigoras
MaRDI profile type: Publication
full work available at URL: 0020-0190(88)90158-5
OpenAlex ID: W2026555151
cites work: Q5585020
cites work: Q3796768
description: scientific article; zbMATH DE number 4082996