Ask Question
2 May, 23:54

What is the analysis and complexity of a shell sortalgorithms?

+4
Answers (1)
  1. 3 May, 00:24
    0
    Answer: The shell sort is based on insertion sort. Here the list of elements are divided into smaller sub list which are sorted based on insertion sort.

    Its best case time complexity is O (n * logn) and worst case is O (n * log^2 n)

    Explanation:

    Shell sort is an inplace sorting here we begin by dividing the list into sublist and sorting the list with insertion sort. We create interval for dividing the list into sub list until we reach the smallest interval of 1.

    The best case is O (n * logn).
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “What is the analysis and complexity of a shell sortalgorithms? ...” in 📘 Computers and Technology if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers