What is the worst case running time of shell sort using Hibbard’s increments?
(a) O(N)
(b) O(N^2)
(c) O(N^1/2)
(d) O(N^3/2)
The question was posed to me during an interview.
Question is from Shell sort in section Sorting of Data Structures & Algorithms II