LearnViz CompSci
Home / Learn / Algorithms / Shell Sort

Intermediate Topic 19 of 51 Algorithms

Shell Sort

Insertion sort over shrinking gaps.

How it works

Shell sort generalizes insertion sort by first comparing and moving elements that are far apart, using a decreasing gap sequence, and ending with a gap of 1 that is a normal insertion sort on nearly sorted data. Large early gaps move elements quickly toward their position. The running time depends on the gap sequence, from O(n squared) for simple halving to about O(n to the 4/3) or better for Sedgewick sequences.

Where it is used

Embedded systems and small libraries that need an in-place sort with little code, such as the uClibc qsort, and mid-sized arrays where recursion should be avoided use shell sort.

Common pitfall

Performance is hard to analyze and varies with the gap sequence, and the sort is not stable. A poor sequence such as powers of two can behave quadratically. It is rarely the fastest choice for large data compared with quicksort or merge sort.

Where it fits in the course

Shell Sort is topic 19 of 51 in Algorithms, rated Intermediate. It follows Heap Sort. The next topic is Bucket Sort.

Practice and explore

How to study this topic

  1. Read the explanation above and restate the definition in your own words.
  2. Open the interactive lesson and answer its mini quiz.
  3. Read the common pitfall, then write a short example that avoids it.
  4. Check your understanding in the Algorithms quiz, and revisit the topic if you miss a question.

Frequently asked questions

What is Shell Sort?
Insertion sort over shrinking gaps. It belongs to Algorithms and is an intermediate-level topic.
Where do people use Shell Sort?
Embedded systems and small libraries that need an in-place sort with little code, such as the uClibc qsort, and mid-sized arrays where recursion should be avoided use shell sort.
What is the most common mistake with Shell Sort?
Performance is hard to analyze and varies with the gap sequence, and the sort is not stable.
What should I learn before this topic?
Start with Heap Sort, the topic just before it in Algorithms.
How can I practice it?
Answer the mini quiz in the interactive lesson, then take the Algorithms quiz. You can also explore Sorting Algorithms in the Visual Lab.
Is Shell Sort hard to learn?
It is an Intermediate topic. Be comfortable with the Beginner topics in this area first, then read the common pitfall carefully, since it is where most mistakes happen.
How long does it take to learn Shell Sort?
Most learners can read the explanation and finish the interactive lesson in under an hour. Fluency comes from applying the idea, so plan a few short practice sessions with the quiz.
Which topics are related to Shell Sort?
Heap Sort, Bucket Sort, Sliding Window are closely connected. The full list is in the related topics section of this page.
What should I study after Shell Sort?
Continue with Bucket Sort, the next topic in Algorithms.

Related topics