- Notifications
You must be signed in to change notification settings - Fork0
This project provides a visual and interactive implementation of the Selection Sort algorithm, designed to help users understand how this sorting method works in practice.
License
amirallami-code/selection-sorting-algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
An interactive demonstration of the Selection Sort algorithm.
This project provides a visual and interactive implementation of the Selection Sort algorithm, designed to help users understand how this sorting method works in practice.
Selection Sort is an in-place comparison-based algorithm that divides the input list into two parts:
- A sorted portion on the left
- An unsorted portion on the right
The algorithm repeatedly selects the smallest (or largest) element from the unsorted portion and moves it to the end of the sorted portion.
- Simple to understand and implement
- Performs well on small lists
- Requires no additional memory space
- Not suitable for large datasets due to O(n²) time complexity
- Interactive sorting visualization
- Custom number input
- Step-by-step sorting process
- Before and after comparison
Experience the algorithm in action:Selection Sort Demo
- Enter a number in the "Enter your number" input field.
- Click "Add Number" to add it to the unsorted list.
- Repeat steps 1-2 to add more numbers.
- Click "Start Sorting" to begin the sorting process.
- Observe the sorted result in the "After Sorting" section.
Clone the repository and openindex.html in your web browser:
git clone https://github.com/amirallami-code/selection-sorting-algorithm.gitcd selection-sorting-algorithmWe enthusiastically welcome contributions! To contribute:
- Fork the project.
- Create your feature branch (
git checkout -b feature/AmazingFeature). - Commit your changes (
git commit -m 'Add some AmazingFeature'). - Push to the branch (
git push origin feature/AmazingFeature). - Open a pull request.
This project is currently under the MIT license. For more information, see theLICENSE file.
For questions or feedback, please contact:
Amirhossein Allami -amirallami.dev@gmail.com
Project Link:https://github.com/amirallami-code/selection-sorting-algorithm
⭐ Star this repository if you find it helpful!
About
This project provides a visual and interactive implementation of the Selection Sort algorithm, designed to help users understand how this sorting method works in practice.
Topics
Resources
License
Uh oh!
There was an error while loading.Please reload this page.
Stars
Watchers
Forks
Uh oh!
There was an error while loading.Please reload this page.

