Shellsort

Known as: Shell Sort, Shell, Shell's method

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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

Algorithm performance coverage in textbooks emphasizes patterns of growth in execution times, relative to the size of the problem…

2012

- Theories of Computer Sciences & Engineering nowadays are being only read than being designed and practiced. Hence in this paper…

2010

정렬 알고리즘에서 사용한 원소 간 비교횟수를 기준으로, 비교횟수가 많게 되는 순열을 최악의 인스턴스(worst-case instance)라 명명하고 이를 찾기 위해 유전 알고리즘(genetic algorithm…

2007

— Many algorithms are available for sorting the unordered elements. Most important of them are Bubble sort, Heap sort, Insertion…

1997

We show lower bounds on the worst-case complexity of Shellsort. In particular, we give a fairly simple proof of an ?(n(lg2n…

1996

A perturbation technique can be used to simplify and sharpen A. C. Yao's theorems about the behavior of shellsort with increments…

1992

The authors give improved lower bounds for Shellsort based on a new and relatively simple proof idea. The lower bounds obtained…

1989

The central result of this paper is that all Shellsort sorting networks based on monotonically decreasing increments require ~t(N…

1988

This paper describes a sorting method obtained by modifying bubble sort. This new sort, while still inefficient, sets the stage…

1987

Shellsort is a simple classic algorithm that runs competitively on both midsized and nearly sorted files. It uses a increment…