+1 vote
in Data Structures & Algorithms II by (110k points)
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(N^2)

I got this question by my school teacher while I was bunking the class.

This interesting question is from Shell sort in portion Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
Right option is (d) O(N^2)

The explanation is: The lower bound of a shell sort algorithm is mathematically found to be O(N^2).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...