#NAME?
Write a Java program that compares the execution times of at least 2 other gaps for the Shell Sort to the original Shell sort (which starts with the gap size of n/2). Try with at least 10000 elements, or several sizes in which you see some timings > 0 (so you should use a gap sequence that is calculated, and you save the gap sequence in an array).