```python
def shell_sort(my_list):
    """
    Sorts a list in place using the Shell Sort algorithm.
    """
    list_size = len(my_list)
    gap = list_size // 2

    while gap > 0:
        # Perform a gapped insertion sort for the current gap size.
        for i in range(gap, list_size):
            # Store the current value to be inserted.
            current_value = my_list[i]
            position = i

            # Shift earlier gap-sorted elements up until the correct
            # location for current_value is found.
            while position >= gap and my_list[position - gap] > current_value:
                my_list[position] = my_list[position - gap]
                position = position - gap

            # Place current_value in its correct location.
            my_list[position] = current_value

        # Reduce the gap for the next pass.
        gap = gap // 2
```