Vidyalelo
Data Structure · Q346

Sorting Algorithms

Programming · Data Structure · question 346

Q346

The worst case running time of shell sort, using Shell's increments is?

A.
O(N)
B.
O(N log N)
C.
O(log N)
D.
O(N2)
Answer

Answer: Option D

Solution

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