Shellsort is a generalization of insertion sort that allows the exchange of items that are far apart. The main idea behind Shellsort is to arrange the list of elements so that, starting anywhere, taking every \( h^{th} \) element produces a sorted list. This is accomplished by first sorting elements that are far apart and progressively reducing the gap between the elements to be compared.
New to topics? Read the docs here!