Vidyalelo
Data Structure · Q272

Sorting Algorithms

Programming · Data Structure · question 272

Q272

What is the worst case running time of shell sort using Hibbard's increments?

A.
O(N)
B.
O(N2)
C.
O(N1/2)
D.
O(N3/2)
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board