Shell sort - Algorithm
Shell sort 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 the exchange of far items. In Shell sort, we make the array h-sorted for a large value of n. We keep reducing the value of h until it becomes 1. An array is said to be n-sorted if all sublists of every n’th element are sorted.
Algorithm:
Step 1 − Start
Step 2 − Initialize the value of gap size, say n.
Step 3 − Divide the list into smaller sub-part. Each must have equal intervals to h.
Step 4 − Sort these sub-lists using insertion sort.
Step 5 – Repeat this step 2 until the list is sorted.
Step 6 – Print a sorted list.
Step 7 – Stop.
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 Алтанцоож Ц 21 March 2024, share the link with friends and acquaintances, this video has already been watched 5,393 times on youtube and it was liked by 54 viewers. Enjoy your viewing!
