{"id":48688551,"url":"https://github.com/amirallami-code/selection-sorting-algorithm","last_synced_at":"2026-04-11T04:38:57.147Z","repository":{"id":171580660,"uuid":"648119581","full_name":"amirallami-code/selection-sorting-algorithm","owner":"amirallami-code","description":"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.","archived":false,"fork":false,"pushed_at":"2024-09-19T16:54:18.000Z","size":4748,"stargazers_count":35,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2026-04-11T04:38:55.910Z","etag":null,"topics":["algorithm","algorithms","selection-algorithm","selection-sort-in-javascript","sorting-algorithms"],"latest_commit_sha":null,"homepage":"https://selection-sorting-algorithm.vercel.app","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/amirallami-code.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-06-01T08:50:59.000Z","updated_at":"2026-04-01T12:26:20.000Z","dependencies_parsed_at":"2024-09-11T15:25:56.686Z","dependency_job_id":"7195dd43-03aa-4782-9b8a-e941ee797d2b","html_url":"https://github.com/amirallami-code/selection-sorting-algorithm","commit_stats":null,"previous_names":["amirallami-code/selective-sorting-algorithm"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/amirallami-code/selection-sorting-algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amirallami-code%2Fselection-sorting-algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amirallami-code%2Fselection-sorting-algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amirallami-code%2Fselection-sorting-algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amirallami-code%2Fselection-sorting-algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/amirallami-code","download_url":"https://codeload.github.com/amirallami-code/selection-sorting-algorithm/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amirallami-code%2Fselection-sorting-algorithm/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31669117,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-10T17:19:37.612Z","status":"online","status_checked_at":"2026-04-11T02:00:05.776Z","response_time":54,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","algorithms","selection-algorithm","selection-sort-in-javascript","sorting-algorithms"],"created_at":"2026-04-11T04:38:57.054Z","updated_at":"2026-04-11T04:38:57.138Z","avatar_url":"https://github.com/amirallami-code.png","language":"JavaScript","readme":"# Selection Sort Algorithm\n\n![Algorithm Demo](images/demo.jpg)\n\n[![MIT License](https://img.shields.io/badge/License-MIT-blue)](https://opensource.org/licenses/MIT)\n![Last Update](https://img.shields.io/github/last-commit/amirallami-code/selection-sorting-algorithm?style=flat\u0026color=blue)\n[![Stars](https://img.shields.io/github/stars/amirallami-code/selection-sorting-algorithm?style=flat\u0026color=yellow)](https://github.com/amirallami-code/selection-sorting-algorithm/)\n![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen)\n![Contributions Welcome](https://img.shields.io/badge/Contributions-welcome-brightgreen)\n\nAn interactive demonstration of the Selection Sort algorithm.\n\n## Table of Contents\n- [Overview](#overview)\n- [What is Selection Sort?](#what-is-selection-sort)\n- [Features](#features)\n- [Demo](#demo)\n- [Usage](#usage)\n- [Installation](#installation)\n- [Contributing](#contributing)\n- [License](#license)\n- [Contact](#contact)\n- [References](#references)\n\n## Overview\n\nThis project provides a visual and interactive implementation of the Selection Sort algorithm, designed to help users understand how this sorting method works in practice.\n\n## What is Selection Sort?\n\nSelection Sort is an in-place comparison-based algorithm that divides the input list into two parts:\n1. A sorted portion on the left\n2. An unsorted portion on the right\n\nThe algorithm repeatedly selects the smallest (or largest) element from the unsorted portion and moves it to the end of the sorted portion.\n\n\u003cp align=\"center\"\u003e\n  \u003cimg width=\"750\" height=\"auto\" src=\"assets/algorithm-animation.gif\"\u003e\n\u003c/p\u003e\n\n\u003cdiv align=\"center\"\u003e\n      \u003ca href=\"https://youtu.be/kPRA0W1kECg?si=VhbgKEH0BB6uqjTQ\"\u003eGIF Reference\u003c/a\u003e\n\u003c/div\u003e\n\n### Advantages\n- Simple to understand and implement\n- Performs well on small lists\n- Requires no additional memory space\n\n### Limitations\n- Not suitable for large datasets due to O(n²) time complexity\n\n## Features\n\n- Interactive sorting visualization\n- Custom number input\n- Step-by-step sorting process\n- Before and after comparison\n\n## Demo\n\nExperience the algorithm in action: [Selection Sort Demo](https://selection-sorting-algorithm.vercel.app)\n\n## Usage\n\n1. Enter a number in the \"Enter your number\" input field.\n2. Click \"Add Number\" to add it to the unsorted list.\n3. Repeat steps 1-2 to add more numbers.\n4. Click \"Start Sorting\" to begin the sorting process.\n5. Observe the sorted result in the \"After Sorting\" section.\n\n## Installation \n\nClone the repository and open `index.html` in your web browser: \n\n```bash \n      git clone https://github.com/amirallami-code/selection-sorting-algorithm.git cd selection-sorting-algorithm\n ```\n\n## Contributing\n\nWe enthusiastically welcome contributions! To contribute:\n 1. Fork the project.\n 2. Create your feature branch (`git checkout -b feature/AmazingFeature`).\n 3. Commit your changes (`git commit -m 'Add some AmazingFeature'`).\n 4. Push to the branch (`git push origin feature/AmazingFeature`).\n 5. Open a pull request.\n\n## License\n\nThis project is currently under the MIT license. For more information, see the [LICENSE](LICENSE) file.\n\n\n## Contact\n\nFor questions or feedback, please contact:\n\nAmirhossein Allami - [amirallami.dev@gmail.com](mailto:amirallami.dev@gmail.com)\n\nProject Link: [https://github.com/amirallami-code/selection-sorting-algorithm](https://github.com/amirallami-code/selection-sorting-algorithm)\n\n## References\n\n1. [GeeksforGeeks - Selection Sort](https://www.geeksforgeeks.org/selection-sort/)\n2. [Simplilearn - Selection Sort Algorithm](https://www.simplilearn.com/tutorials/data-structure-tutorial/selection-sort-algorithm)\n\n---\n\n⭐ Star this repository if you find it helpful!\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Famirallami-code%2Fselection-sorting-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Famirallami-code%2Fselection-sorting-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Famirallami-code%2Fselection-sorting-algorithm/lists"}