Examine the steps of the following algorithm and write the name of the algorithm described in the blank provided:

For each position from the beginning of an array to its end, find the least item in the remainder of the array (excluding the current position and all positions occurring before it in the array) and place it in the current position.

1.insertion

2. sort selection

3. sort shell

4.sort merge

5. sort quicksort

6. radix sort