Shell sort, also known as Diminishing increment sort, Comb sort, and Gap sort, is a comparison-based sorting algorithm.The algorithm sorts elements that have a certain gap between them, reducing the gap until it reaches 1.Different ways of selecting the gap sequence include Original Sequence, Hibbard Sequence, and Sedgewick Sequence.The time complexity of Shell Sort is O(n^2).