Implementing and Visualizing Selection Sort in Python

This Python script visually demonstrates how the Selection Sort algorithm works using Matplotlib. It generates 50 random integers between 1 and 100, sorts them using selection sort, and visualizes the sorting process step by step

Time Complexity:
- Best Case: O(n^2)
- Average Case: O(n^2)
- Worst Case: O(n^2)

Space Complexity:
O(1) (In-place sorting)