The Shell sort is a variation of the bubble sort. Instead of comparing adjacentvalues, the Shell sort adapts a concept from the binary search to determine a‘gap' across which values are compared before any swap takes place.
In thefirst pass, the gap is half the size of the array. For each subsequent pass, thegap size is cut in half. For the final pass(es), the gap size is 1, so it would bethe same as a bubble sort. The passes continue until no swaps occur.
I have all of the code done their is just a small error that is needing fixing.
Attachment:- Shellsort.rar