ShellSort

ShellSort is mainly a variation of Insertion Sort. In insertion sort, we move elements only one position ahead. When an element has to be moved far ahead, many movements are involved. The idea of shellSort is to allow exchange of far items. In shellSort, we make the array h-sorted for a large value of h … More on Shell Sort
 

1
Question 1
What is the best case complexity for shell sort?
A
O(1)
B
O(n)
C
O(logn)
D
O(n logn)
ShellSort    
Discuss it


There is 1 question to complete.
1

 

Coding practice for sorting

 



My Personal Notes arrow_drop_up


Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.