How it works

Selection Sort is like organizing toy blocks by always picking the smallest one and putting it in the right spot. First, you find the smallest block and swap it with the first one. Then, you find the next smallest and swap it with the second block. You keep doing this until everything is in order. It’s simple but takes a long time for big lists, with a time complexity of O(n²).