The worst case running time of shell sort, using Shell’s increments is?
(b) O(N log N)
(c) O(log N)
I got this question by my school teacher while I was bunking the class.
This interesting question is from Shell sort in portion Sorting of Data Structures & Algorithms II