# Shell Sort Gap Sequences: Explained

Shell Sort Gap Sequences shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Insertion-sort elements a gap apart, shrinking the gap with a good sequence such as Ciura or 3x+1.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

Sub-quadratic in practice; depends on the gap sequence.

## Common mistake

Halving gaps from n/2, which gives poor worst-case behavior.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI tool for job interviews.