Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,257,087 papers from all fields of science
Search
Sign In
Create Free Account
Shellsort
Known as:
Shell Sort
, Shell
, Shell's method
Expand
Shellsort, also known as Shell sort or Shell's method, is an in-place comparison sort. It can be seen as either a generalization of sorting by…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
24 relations
Adaptive sort
Array data structure
Bitonic sorter
Bubble sort
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Distribution of Execution Times for Sorting Algorithms Implemented in Java
Kirby McMaster
,
S. Sambasivam
,
B. Rague
,
S. Wolthuis
2015
Corpus ID: 17367887
Algorithm performance coverage in textbooks emphasizes patterns of growth in execution times, relative to the size of the problem…
Expand
2009
2009
Research on Collision Detection Algorithm Based on AABB
Xiaorong Wang
,
Meng Wang
,
Chungui Li
Fifth International Conference on Natural…
2009
Corpus ID: 9846668
An improved collision detection algorithm based on AABB is presented. During the global search, each axis is cut into a series of…
Expand
2007
2007
Enhanced Shell Sorting Algorithm
B. Shahzad
,
M. Afzal
2007
Corpus ID: 12354879
— Many algorithms are available for sorting the unordered elements. Most important of them are Bubble sort, Heap sort, Insertion…
Expand
1999
1999
Faster shellsort sequences: A genetic algorithm application
R. Simpson
,
Shashidhar Yachavaram
International Conference on Computers and Their…
1999
Corpus ID: 5858140
The recent popularity of genetic algorithms (GA's) and their application to a wide variety of problems is a result of their ease…
Expand
1997
1997
Lower Bounds for Shellsort
Greg Plaxton
,
Torsten Suel
,
Greg Plaxton
J. Algorithms
1997
Corpus ID: 17015238
We show lower bounds on the worst-case complexity of Shellsort. In particular, we give a fairly simple proof of an ?(n(lg2n…
Expand
1996
1996
Shellsort with three increments
S. Janson
,
D. Knuth
Random Struct. Algorithms
1996
Corpus ID: 2114610
A perturbation technique can be used to simplify and sharpen A. C. Yao's theorems about the behavior of shellsort with increments…
Expand
1992
1992
Improved lower bounds for Shellsort
Greg Plaxton
,
B. Poonen
,
Torsten Suel
Proceedings., 33rd Annual Symposium on…
1992
Corpus ID: 15095863
The authors give improved lower bounds for Shellsort based on a new and relatively simple proof idea. The lower bounds obtained…
Expand
1987
1987
Lower bounds for shellsort
M. Weiss
1987
Corpus ID: 115598551
Shellsort is a simple classic algorithm that runs competitively on both midsized and nearly sorted files. It uses a increment…
Expand
Review
1985
Review
1985
MATHEFATICAL METHODS IN THE ANALYSIS OF ALGORITHMS AND DATA STRUCTURES
P. Flajolet
1985
Corpus ID: 123792775
?his paper is intended both as a. tutorial paper and a partial review of advanced mathematical methods in the average case…
Expand
1983
1983
Parallel sorting
B. Bollobás
,
A. Thomason
Discrete Applied Mathematics
1983
Corpus ID: 205053663
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE