Compare performance of shell sort implementations

Compare the performance of shell sort implementations that use respectively the sequence of decrements n/2, n/4, n/8, …, 1 and 2P-1, …, 31, 15, 7, 3, 1. Use random data sets and use the number of comparisons and moves as a measure.

Leave a Reply

Your email address will not be published. Required fields are marked *