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'.
En esta página del sitio puede ver el video en línea Shell Sort - Data Structures & Algorithms Tutorial Python #18 de Duración hora minuto segunda en buena calidad , que subió el usuario codebasics 01 enero 1970, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 62,201 veces y le gustó 884 a los espectadores. Disfruta viendo!