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).
