Analyzing variants of Shellsort
type: Item
instance of: scholarly article
title: Analyzing variants of Shellsort
zbMATH Open document ID: 1032.68088
DOI: 10.1016/S0020-0190(00)00223-4
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 1767383
zbMATH Keywords: Analysis of algorithms
zbMATH Keywords: Sorting
zbMATH Keywords: Kolmogorov complexity
Wikidata QID: Q55885385
author: Broňa Brejová
MaRDI profile type: Publication
cites work: A lower bound on the average-case complexity of shellsort
cites work: Q4057549
cites work: Q4337021
cites work: The Worst Case in Shellsort and Related Algorithms
cites work: Analysis of Shellsort and related algorithms
cites work: Bad cases for shaker-sort
DBLP publication ID: journals/ipl/Brejova01
description: scientific article; zbMATH DE number 1767383