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.
Nesta página do site você pode assistir ao vídeo on-line Shell sort - Algorithm duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário Алтанцоож Ц 21 Março 2024, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 5,393 vezes e gostou 54 espectadores. Boa visualização!
![[科普]如果全世界的貓突然死掉會發生甚麼事情 What If All Cats Died Right Now](https://image.4k-video.ru/id-video/tkApspy6jgo)
