Selection Sort in Python

Step-by-Step Explanation:-
1. Selection sort is a sorting algorithm that repeatedly finds the smallest element in the unsorted part of the list and moves it to the sorted part.
2. The function takes a list of numbers as an argument and returns the sorted list.
3. The function uses two nested loops to iterate over the list. The outer loop keeps track of the current position in the sorted part, and the inner loop finds the smallest element in the unsorted part.
4. The function uses a variable min_index to store the index of the smallest element in the unsorted part. It initializes it to the current position in the outer loop and then updates it if it finds a smaller element in the inner loop.
5. Using a tuple assignment, the function then swaps the current element with the smallest element in the unsorted part. This way, the smallest element is moved to the sorted part, and the current element is moved to the unsorted part.
6. The function repeats this process until the entire list is sorted, and then returns the sorted list.