Selection Sort

Write selection_sort(values: list[int]) -> None that sorts the list in place: for each position i from the front, find the index smallest of the least value from i to the end with an inner loop, then swap the values at i and smallest through a temp variable. The inner loop scans the whole unsorted part every time, so this is O(n squared) even on sorted input. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: one line of space-separated integers (possibly empty); the tests call your function and then print the list.