If Hibbard increments (h1= 1, h2= 3, h3= 7, …, hk = 2k–1) are used in a Shell sortimplementation, then the best case time complexity will be
A. O(nlogn)
B. O(n)
C. O(n2)
D. O(logn)
Answer:A
If Hibbard increments (h1= 1, h2= 3, h3= 7, …, hk = 2k–1) are used in a Shell sortimplementation, then the best case time complexity will be
A. O(nlogn) B. O(n) C. O(n2) D. O(logn)