The question is intended as a self-test for readers. Answers may be found in Appendix C.
To transform the insertion sort into the Shellsort, which of the following do you nut do?
a. Substitute h for 1.
b. Insert an algorithm for creating gaps of decreasing width.
c. Enclose the normal insertion sort in a loop.
d. Change the direction of the indices in the inner loop.
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.