Shellsort increments. Run experiments to compare the increment sequence in algorithm 2.3 with the sequence 1, 5, 19, 41, 109, 209, 505, 929, 2161, 3905, 8929, 16001, 36289, 64769, 146305, 260609 (which is formed by merging together the sequences 9-4k—9-2k + 1 and 4k—3-2k + 1). See exercise 2.1.11.
Exercise.
Implement a version of shellsort that keeps the increment sequence in an array, rather than computing it.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.