Shell Sort is a generalized version of insertion sort. It is an in–place comparison sort. Shell Sort is also known as diminishing increment sort, it is one of the oldest sorting algorithms invented by Donald L. Shell (1959.)
This algorithm uses insertion sort on the large interval of elements to sort. Then the interval of sorting keeps on decreasing in a sequence until the interval reaches 1. These intervals are known as gap sequence.
This algorithm works quite efficiently for small and medium size array as its average time complexity is near to O(n).
...............
/ shahin.6320
/ shubvranto
/ shahinul-haque
On this page of the site you can watch the video online Shell Sort Algorithm with a duration of hours minute second in good quality, which was uploaded by the user Md Sahinul Hoq 14 November 2018, share the link with friends and acquaintances, this video has already been watched 42,740 times on youtube and it was liked by 411 viewers. Enjoy your viewing!