{"id":22446865,"url":"https://github.com/ppmpreetham/typewriter-sort","last_synced_at":"2025-07-08T06:06:40.880Z","repository":{"id":214877296,"uuid":"737573166","full_name":"ppmpreetham/typewriter-sort","owner":"ppmpreetham","description":"A Unique Sorting Algorithm","archived":false,"fork":false,"pushed_at":"2024-01-06T05:25:52.000Z","size":14,"stargazers_count":1,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-08T06:05:45.727Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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.md","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}},"created_at":"2023-12-31T15:21:20.000Z","updated_at":"2024-04-16T14:18:11.000Z","dependencies_parsed_at":"2024-01-06T06:45:53.641Z","dependency_job_id":null,"html_url":"https://github.com/ppmpreetham/typewriter-sort","commit_stats":null,"previous_names":["preetham-ai/typewriter-sort","ppmpreetham/typewriter-sort"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ppmpreetham/typewriter-sort","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ppmpreetham%2Ftypewriter-sort","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ppmpreetham%2Ftypewriter-sort/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ppmpreetham%2Ftypewriter-sort/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ppmpreetham%2Ftypewriter-sort/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ppmpreetham","download_url":"https://codeload.github.com/ppmpreetham/typewriter-sort/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ppmpreetham%2Ftypewriter-sort/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":264207076,"owners_count":23572725,"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":[],"created_at":"2024-12-06T04:12:23.632Z","updated_at":"2025-07-08T06:06:40.862Z","avatar_url":"https://github.com/ppmpreetham.png","language":"Rust","readme":"# typewriter-sort\nA sorting algorithm has a time complexity of $`O(n)`$ and in the worst case, it has a time complexity of $`O( \\infty )`$.\nYes, it's worse than Bogosort, Bozosort and Bogobogosort.\n\nThe algorithm was made as a joke on a search to make the worst algorithm of all time.\nThe usage of two ```while``` loops makes it impossible to give the desired output in time.\n\n## Usage\n### Python\n\n```python\nimport {typewriter_sort} from '@Preetham-ai/typewriter-sort'\ntest_array = [7,5,338,46,21,2,9]\nprint(typewriter_sort(test_array))\n```\n\n### Rust\n\n```rust\nfn main() {\n    let test_array = vec![7,5,338,46,21,2,9];\n    let result = typewriter_sort(\u0026test_array);\n    println!(\"{:?}\", result);\n}\n```\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fppmpreetham%2Ftypewriter-sort","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fppmpreetham%2Ftypewriter-sort","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fppmpreetham%2Ftypewriter-sort/lists"}