|
1 | | -## Selective Sorting Algorithm |
2 | | -Selection sort is a simple sorting algorithm. This sorting algorithm is a comparison-based algorithm in which the list is divided into two parts: |
3 | | -the sorted part at the left end and the unsorted part at the right end. |
4 | | -Initially, the sorted part is empty and the unsorted part is the whole list, in this code, each part is considered as an array. |
| 1 | +## Selection Sorting Algorithm |
| 2 | +This repository contains an implementation of selection sort, a simple and efficient sorting algorithm. |
| 3 | + |
| 4 | +## What is an Algorithm? |
| 5 | +An algorithm is a set of instructions or rules that guide the computer or software in performing a particular task or solving a problem 1. |
| 6 | + |
| 7 | +## What is Selection Sorting Algorithm and How Does it Help Us? |
| 8 | +Selection sort is an in-place comparison-based algorithm that divides the list into two parts, the sorted part on the left and the unsorted part on the right . It works by repeatedly selecting the smallest (or largest) element from the unsorted portion of the list and moving it to the sorted portion of the list . |
| 9 | + |
| 10 | +Selection sort has several advantages over other sorting algorithms. It is simple to understand and implement, requires no additional memory space, and performs well on small lists . However, it is not suitable for large lists as its time complexity is O(n2) . |
| 11 | + |
| 12 | +## Installation |
| 13 | +To install this project, simply clone the repository and open the index.html file in your web browser. |
| 14 | +```bash |
| 15 | + git clone https://github.com/amirallami-code/selection-sorting-algorithm |
| 16 | +``` |
| 17 | + |
| 18 | +## License |
| 19 | +This project does not have any license. |
| 20 | + |
| 21 | +## Usage |
| 22 | +To use this project and see how it works to sort our numbers, we should type a number in the input field that reads `Enter your number` and click on the `Add Number` button to add our number to the basket of numbers that are not sorted (`your numbers` section). When you have typed all of your numbers and added them to the basket, click on the `Start Sorting` button. The result will appear in the `After Sorting` section, where you can see that your numbers are sorted! |
| 23 | + |
| 24 | +## References |
| 25 | +- https://www.geeksforgeeks.org/selection-sort/ |
| 26 | +- https://www.simplilearn.com/tutorials/data-structure-tutorial/selection-sort-algorithm |
| 27 | + |
| 28 | +## Contact Information |
| 29 | +If you have any questions or concerns about this project, please contact us at amirallami.dev@gmail.com |
| 30 | + |
| 31 | +I hope this helps! Let me know if you have any other questions. |
0 commit comments