4. This problem is about shell sort. Some said the best initial gap size is the floor of the half of the length of the list. Explain why. Suppose the gap size used in iteration i is g., what is the...

Do it soon


Extracted text: 4. This problem is about shell sort. Some said the best initial gap size is the floor of the half of the length of the list. Explain why. Suppose the gap size used in iteration i is g., what is the relation between g, and g.1? What is the termination condition for shell sort? Based on the above description, analyse the time complexity for shell sort for sorting a list of n numbers.