1. The Shell sort works by a. partitioning the array. b. swapping adjacent elements. c. dealing with widely separated elements. d. starting with the normal insertion sort. 2. If an array has 100...

1.
The Shell sort works by

a.
partitioning the array.

b.
swapping adjacent elements.

c.
dealing with widely separated elements.

d.
starting with the normal insertion sort.

2.
If an array has 100 elements, then Knuth’s algorithm would start with an

interval of ________.