Insertion Sort is an algorithm that builds the final sorted array one item at a time.
It is simple and adaptable, making it efficient for small datasets.
Shell Sort is another sorting algorithm that sorts elements at a specific interval and gradually reduces the interval until performing a final pass using insertion sort.
Shell Sort performs better than Insertion Sort but is unstable.