1.

If Hibbard increments (h1= 1, h2= 3, h3= 7, , hk = 2k 1) are used in a Shell sort implementation, then the best case time complexity will be ________

A. O(nlogn)
B. O(n)
C. O(n<sup>2</sup>)
D. O(logn)
Answer» B. O(n)


Discussion

No Comment Found

Related MCQs