Q170
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)
AnswerB.
O(n)
C.
O(n2)
D.
O(logn)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board