0
I had the following assignment for the Python 101 course I'm taking in my university.
'''
Modify the naive implementation (see below) of a sorting algorithm so that
the list to be sorted is modified *in place*.
Here is the idea:
1. Iterate over all indices i = 0, 1, 2, ... of the input list
...