{"id":29855910,"url":"https://github.com/archerhume/sortingalgorithms","last_synced_at":"2025-09-23T19:03:38.312Z","repository":{"id":171166614,"uuid":"469705156","full_name":"ArcherHume/sortingAlgorithms","owner":"ArcherHume","description":"📊 A collection of sorting algorithms written in Python. An educational tool used for demonstrations of said algorithms.","archived":false,"fork":false,"pushed_at":"2024-10-04T04:37:16.000Z","size":28,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-07-30T00:04:13.617Z","etag":null,"topics":["algorithms","data-science","python","sorting-algorithms"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ArcherHume.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"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,"zenodo":null}},"created_at":"2022-03-14T11:33:47.000Z","updated_at":"2024-10-04T04:37:19.000Z","dependencies_parsed_at":null,"dependency_job_id":"e06d9a6a-4f73-45db-8089-9a0421987452","html_url":"https://github.com/ArcherHume/sortingAlgorithms","commit_stats":null,"previous_names":["archerhume/sortingalgorithms"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ArcherHume/sortingAlgorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ArcherHume%2FsortingAlgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ArcherHume%2FsortingAlgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ArcherHume%2FsortingAlgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ArcherHume%2FsortingAlgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ArcherHume","download_url":"https://codeload.github.com/ArcherHume/sortingAlgorithms/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ArcherHume%2FsortingAlgorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":276631048,"owners_count":25676644,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-09-23T02:00:09.130Z","response_time":73,"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":["algorithms","data-science","python","sorting-algorithms"],"created_at":"2025-07-29T23:23:53.227Z","updated_at":"2025-09-23T19:03:38.269Z","avatar_url":"https://github.com/ArcherHume.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# sortingAlgorithms\n\nA collection of sorting algorithms written in Python. An educational tool used for demonstrations of said algorithms.\n\n![](https://i.imgur.com/mVybEng.png)\n\n## Current Algorithms\n\n- [Bubble Sort](https://en.wikipedia.org/wiki/Bubble_sort)\n- [Selection Sort](https://en.wikipedia.org/wiki/Selection_sort)\n- [Selection Sort (Recursion)](https://en.wikipedia.org/wiki/Selection_sort)\n- [Quick Sort](https://en.wikipedia.org/wiki/Quicksort)\n- [Insertion Sort](https://en.wikipedia.org/wiki/Insertion_sort)\n- [Shell sort](https://en.wikipedia.org/wiki/Shellsort)\n- [Comb Sort](https://en.wikipedia.org/wiki/Comb_sort)\n\n## Quick Start\n\n- Clone Repository:\n  ```\n  git clone https://github.com/ArcherHume/sortingAlgorithms.git\n  cd sortingAlgorithms\n  ```\n- Install Dependencies:\n  ```\n  pip install -r requirements.txt\n  ```\n- Run Script: [Usage](#usage)\n\n## Usage\n\n```\nUSAGE:\n    python main.py -t [algorithm]\n\n    Flags:\n        -t [algorithm] (Required): The algorithm you would like to run.\n            Choose from: selection, selection_recursive, bubble, quick_sort, insertion, shell, comb.\n        -l [length] (Optional): The length of the array to be sorted. Defaults to 5000.\n        -r [repeats] (Optional): The number of times to repeat the algorithm. Defaults to 3.\n        -d [delay] (Optional): The delay between each step of the algorithm, used to watch each individual step. Defaults to 0.\n        -width [width] (Optional): The width of the screen. Defaults to 800.\n        -height [height] (Optional): The height of the screen. Defaults to 600.\n        -h (Optional): Prints this message.\n        -debug (Optional): Enables debug mode.\n\n    Example: python main.py -t selection -l 10000 -r 6\n```\n\n## How to add a new algorithm\n\n- Open the `modules/sorting_algorithms.py` file.\n- Create a function with a lowercase, underscore-separated name. Add the positional arguments `array` then `delay`.\n  - Example: `def selection_sort(sorting_array, delay)`\n- Any modifications/sorting done on the array will be reflected on screen.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farcherhume%2Fsortingalgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Farcherhume%2Fsortingalgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farcherhume%2Fsortingalgorithms/lists"}