{"id":18076681,"url":"https://github.com/glesica/shotgun-sort","last_synced_at":"2025-04-05T19:45:57.246Z","repository":{"id":2948718,"uuid":"3962226","full_name":"glesica/shotgun-sort","owner":"glesica","description":"ANSI C Implementation of Shotgun Sort","archived":false,"fork":false,"pushed_at":"2017-09-27T06:58:58.000Z","size":4,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-04-01T12:53:06.531Z","etag":null,"topics":["c","sorting","sorting-algorithms","stupid"],"latest_commit_sha":null,"homepage":"","language":"C","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/glesica.png","metadata":{"files":{"readme":"README","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}},"created_at":"2012-04-08T03:44:27.000Z","updated_at":"2017-09-27T06:08:15.000Z","dependencies_parsed_at":"2022-07-21T13:18:19.504Z","dependency_job_id":null,"html_url":"https://github.com/glesica/shotgun-sort","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/glesica%2Fshotgun-sort","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/glesica%2Fshotgun-sort/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/glesica%2Fshotgun-sort/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/glesica%2Fshotgun-sort/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/glesica","download_url":"https://codeload.github.com/glesica/shotgun-sort/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247393539,"owners_count":20931810,"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":["c","sorting","sorting-algorithms","stupid"],"created_at":"2024-10-31T11:10:50.455Z","updated_at":"2025-04-05T19:45:57.215Z","avatar_url":"https://github.com/glesica.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"An ANSI C implementation of Shotgun Sort. The general algorithm works as such:\n\nSGSORT(list):\n    while list is not sorted:\n        randomize list\n\nNote: This should be obvious, but in case it isn't, don't actually use this \nalgorithm for real work. It's time complexity is unbounded and it may never \nterminate.\n\nNote 2: I didn't think very hard about the randomize() function, it may \nnot produce orderings in a uniformly distributed manner. But really who \ncares, as long as all orderings are possible.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fglesica%2Fshotgun-sort","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fglesica%2Fshotgun-sort","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fglesica%2Fshotgun-sort/lists"}