What is the worst case running time of shell sort using Hibbard s incr

1.	What is the worst case running time of shell sort using Hibbard s increments?
A.	O(N)
B.	O(N<sup>2</sup>)
C.	O(N<sup>1/2</sup>)
D.	O(N<sup>3/2</sup>)
Answer» E.

Discussion