Shell sort Start by sorting pairs of elements far apart from each other, then reduce the gap between elements to be compared. Generalization of insertion sort Sort every k-th elements by considering k interleaved lists. Reduce the size of k by 1. This is similar to insertion sort, but considers the gap between elements. When the gap is one, it is same as insertion sort. void IncInsertionSort(int..
