Selection sort
How it works
Selection Sort finds the smallest element in the list and moves it to the correct position, one step at a time, like selecting the best items from a messy shelf.
-
🔹 Search through the list to find the smallest item → Swap it with the first unsorted position → Repeat until sorted.
-
🔹 Best & worst case: Always O(n²) since it searches the entire list every time.
-
🔹 Why learn it? It's easy to understand and doesn't need extra memory.
👀 Think of it as: Picking the shortest friend in a line and moving them to the front.
How it works in code
How to play
Goal: Find and move the smallest element into the correct position.
Buttons:
-
Next ⏭️ → Move through the list to find the smallest element.
-
Select 🎯 → Marks the smallest element found.
-
Move 🔄 → Moves the selected element to the correct position on the left.
-
Submit ✅ → Checks if the list is fully sorted.
👀 Tip: Once an element is sorted, it turns green and becomes part of the final list!
Time:
0:60
Lives:
❤️❤️❤️