What is the worst case analysis of Shell sort using Sedgewick’s increments?
(a) O(N^2)
(b) O(N^3/2)
(c) O(N^4/3)
(d) O(N^5/4)
This question was addressed to me in homework.
Question is taken from Shell sort in portion Sorting of Data Structures & Algorithms II