The first diminishing increment sort. On each pass, ‘i’ sets of n/i items are sorted, typically with insertion sort. On each succeeding pass, i is reduced until it is 1 for the last pass. A good series of i values is important to efficiency
The first diminishing increment sort. On each pass, ‘i’ setsof n/i items are sorted, typically with insertion sort. On eachsucceeding pass, i is reduced until it is 1 for the last pass. Agood series of i values is important to efficiency