Shell sort is a customization over insertion sort. Insertion sort requires many swaps and comparisons if heavy elements are located towards the end of an array. Shell sort will initially sort subarrays that are equal distance apart. The distance here is referred to as a gap. We will than keep on reducing the gap until it is 1. With gap=1 it becomes insertion sort but this time due to optimization we have performed earlier, sorting the array would require very less comparisons and element swaps.
Code: https://github.com/codebasics/data-st...
Exercise: https://github.com/codebasics/data-st...
Data structures and algo in python playlist: • Data Structures And Algorithms In Python
🔖Hashtags🔖
#Shellsort #datastructures #algorithms #python #Shellsortpython #sortalgorithm #pythonShellsort #Shellsort #datastructure #Shellsortcode #Shellsortprogram
Do you want to learn technology from me? Check https://codebasics.io/ for my affordable video courses.
Website: http://codebasics.io/
Facebook: / codebasicshub
Twitter: / codebasicshub
Linkedin: / codebasics
Discord: / discord
DISCLAIMER: All opinions expressed in this video are of my own and not that of my employers'.
Nesta página do site você pode assistir ao vídeo on-line Shell Sort - Data Structures & Algorithms Tutorial Python #18 duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário codebasics 01 Janeiro 1970, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 62,201 vezes e gostou 884 espectadores. Boa visualização!