Shell sort is a sorting algorithm almost identical to insertion sort. The main difference is shell sort compares items based on an interval. This interval is initially set the Math.floor(arr.length/2). As we run our code, the interval will halve itself until it equals 0. At this point the array is sorted. Shell sort has an average time complexity of O(n^1.25).
Shell Sort Source Code: https://github.com/Brixsta/Algorithms/blob/main/Sort/Shell%20Sort.js
Shell Sort Slides: https://docs.google.com/presentation/d/1T0TCX_Cqmi_6ByONrDmaYO41Mfq1WDD85eCyGitrWP8/edit?usp=sharing
Chapters:
0:00 Intro
0:27 Shell Sort Explanation
6:44 Coding Shell Sort
13:02 Outro
