[FEATURE]: Selection Sort #95
Description
Motivation
I am writing to suggest the addition of a new feature to the algorithms repository - the selection sort algorithm.
Selection sort is a popular sorting algorithm that is simple to understand and implement. It works by repeatedly finding the minimum element from the unsorted portion of the list and swapping it with the first unsorted element. The algorithm continues this process until the entire list is sorted.
Adding this feature to the algorithms repository will provide a valuable resource for those looking to learn or implement selection sort. Furthermore, including selection sort in the repository will increase the diversity of sorting algorithms available, making it an even more comprehensive resource for developers and students.
I would be happy to contribute to the implementation of this new feature and help in any way possible. Thank you for your time and consideration.
Examples
No response
Possible workarounds
No response