It has been observed that the
enhanced shell sorting algorithm can solve the problem in
almost 20 times less swaps as compared to insertion sort and
in almost half swaps as compared to the shell sorting
algorithm. Fig. 3 shows the detailed overview of the number
of swaps required to sort different number of elements.