{"id":22446860,"url":"https://github.com/ppmpreetham/counter-sort","last_synced_at":"2025-03-27T11:22:53.698Z","repository":{"id":214882549,"uuid":"737585313","full_name":"ppmpreetham/counter-sort","owner":"ppmpreetham","description":"A Unique Sorting Algorithm","archived":false,"fork":false,"pushed_at":"2024-05-05T09:33:38.000Z","size":10,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-01T15:46:03.775Z","etag":null,"topics":["algorithm","dsa-algorithm","sorting-algorithm"],"latest_commit_sha":null,"homepage":"","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ppmpreetham.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-12-31T16:18:57.000Z","updated_at":"2024-05-11T06:29:38.000Z","dependencies_parsed_at":"2023-12-31T17:24:19.201Z","dependency_job_id":"ef9dce65-4b29-4751-9d5c-c5fb9f52aea3","html_url":"https://github.com/ppmpreetham/counter-sort","commit_stats":null,"previous_names":["preetham-ai/counter-sort","ppmpreetham/counter-sort"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ppmpreetham%2Fcounter-sort","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ppmpreetham%2Fcounter-sort/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ppmpreetham%2Fcounter-sort/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ppmpreetham%2Fcounter-sort/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ppmpreetham","download_url":"https://codeload.github.com/ppmpreetham/counter-sort/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245833064,"owners_count":20679776,"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","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","dsa-algorithm","sorting-algorithm"],"created_at":"2024-12-06T04:12:23.614Z","updated_at":"2025-03-27T11:22:53.677Z","avatar_url":"https://github.com/ppmpreetham.png","language":"Rust","readme":"# Counter-sort\nThis Algorithm uses iteration to sort elemnts in the array with a time complexity of $`O(n^2)`$.\n\n## Setup\n### Usage in Python\n\n```python\nimport {counter-sort} from '@Preetham-ai/counter-sort'\n\ntest_list=[3,2,5,2,3,6,99,72]\nprint(counter-sort(test_list))\n```\n\n### Usage in Rust\n```rust\nfn main() {\n    let test_list = vec![3,2,5,2,3,6,99,72];\n    let result = counter_sort(test_list);\n    println!(\"{:?}\", result);\n} ```","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fppmpreetham%2Fcounter-sort","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fppmpreetham%2Fcounter-sort","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fppmpreetham%2Fcounter-sort/lists"}