We're suppose to sort the numbers from lowest to highest using the shell short algorithm. It gives us the fibanacci numbers or k in this instance. So using k I have to either K=4 or k=2. Does that clarify things?

4. An array contains the elements shown below. Show the contents of the array after it goes through every pass of the shell sort. The sequence for the increment factor is 1, 2, 4, 8, ... (k = 2k1.1, k=1) 10 16 11 4 15 39