What is the pseudocode for the selection sort algorithm and how does it work?

The pseudocode for the selection sort algorithm is as follows:

1. Start with the first element as the minimum.
2. Compare the minimum with the next element in the list.
3. If the next element is smaller, update the minimum.
4. Continue this process until the end of the list is reached.
5. Swap the minimum element with the first element.
6. Repeat the process for the remaining elements in the list.

Selection sort works by repeatedly finding the minimum element from the unsorted part of the list and swapping it with the first unsorted element. This process continues until the entire list is sorted.