Skip to content

Commit 4e5ecc0

Browse files
committed
Add shellshort reference
1 parent 2cdfd8a commit 4e5ecc0

File tree

1 file changed

+12
-0
lines changed

1 file changed

+12
-0
lines changed

docs/references/bib.bib

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2599,3 +2599,15 @@ @article{vanreeken:1968a
25992599
volume = {11},
26002600
year = {1968},
26012601
}
2602+
2603+
@inproceedings{ciura:2001a,
2604+
abstract = {This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousand elements. The obtained sequences outperform by about 3{\%} the best ones known so far, and there is a plausible evidence that they are the optimal ones.},
2605+
author = {Marcin Ciura},
2606+
booktitle = {Fundamentals of Computation Theory},
2607+
keywords = {sorting, algorithms, shellshort},
2608+
pages = {106--117},
2609+
publisher = {Springer Berlin Heidelberg},
2610+
title = {{Best Increments for the Average Case of Shellsort}},
2611+
year = {2001},
2612+
}
2613+

0 commit comments

Comments
 (0)