Shell Sort can be thought of as a more efficient variation of insertion sort as it achieves this mainly by comparing items of varying distances apart resulting in a run time complexity of O(n log 2 n). It is fairly straight forward but may seem somewhat confusing at first as it differs from other sorting algorithms in the way it selects items to compare.
Figure below shows shell sort being ran on an array of integers :-
That’s it for this one !!!