+1 vote
in Data Structures & Algorithms II by (110k points)
What is the worst case analysis of shell sort using Shell’s increments?

(a) O(N)

(b) O(N^2)

(c) O(N^1/2)

(d) O(N^3/2)

I got this question in semester exam.

This key question is from Shell sort in chapter Sorting of Data Structures & Algorithms II

1 Answer

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

The explanation is: The worst case analysis is mathematically found to be O(N^2). The proof is rather complicated.

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.