{"id":37158867,"url":"https://github.com/luabagg/concurrent-bogosort","last_synced_at":"2026-01-14T18:59:11.566Z","repository":{"id":245970089,"uuid":"696089190","full_name":"luabagg/concurrent-bogosort","owner":"luabagg","description":"Concurrent Bogosort generates permutations of its input until it finds one that is sorted","archived":true,"fork":false,"pushed_at":"2024-06-25T04:12:32.000Z","size":100,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-06-27T05:08:08.331Z","etag":null,"topics":["bogosort","concurrency","goroutines","ordering-algorithms"],"latest_commit_sha":null,"homepage":"https://pkg.go.dev/github.com/luabagg/concurrent-bogosort","language":"Go","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/luabagg.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-09-25T04:02:34.000Z","updated_at":"2024-06-25T04:14:39.000Z","dependencies_parsed_at":"2024-06-25T04:50:03.113Z","dependency_job_id":"7aa08e91-5c9c-45f4-8846-90b312fc511a","html_url":"https://github.com/luabagg/concurrent-bogosort","commit_stats":null,"previous_names":["luabagg/factorial-bogosort"],"tags_count":3,"template":false,"template_full_name":null,"purl":"pkg:github/luabagg/concurrent-bogosort","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luabagg%2Fconcurrent-bogosort","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luabagg%2Fconcurrent-bogosort/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luabagg%2Fconcurrent-bogosort/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luabagg%2Fconcurrent-bogosort/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/luabagg","download_url":"https://codeload.github.com/luabagg/concurrent-bogosort/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luabagg%2Fconcurrent-bogosort/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28431073,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-14T16:38:47.836Z","status":"ssl_error","status_checked_at":"2026-01-14T16:34:59.695Z","response_time":107,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["bogosort","concurrency","goroutines","ordering-algorithms"],"created_at":"2026-01-14T18:59:10.889Z","updated_at":"2026-01-14T18:59:11.558Z","avatar_url":"https://github.com/luabagg.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Concurrent Bogosort\n\n\u003cimg align=\"right\" width=\"500\" src=\"./docs/_media/golang-what.webp\" alt=\"Golang What\"/\u003e\n\n## What is Bogosort?\n\nBogosort, also known as permutation sort, stupid sort, slow sort, shotgun sort or monkey sort is a particularly ineffective algorithm one person can ever imagine.\n\nIt is based on generate and test paradigm. The algorithm successively generates permutations of its input until it finds one that is sorted.\n\n## How does Concurrent Bogosort works?\n\nThis code opens a new goroutine sequentially, applying the bogosort technique until one matches a sorted array.\nAt the end of the execution, you can see the number of opened goroutines.\n\n## WHY?\n\nThis is just a study of Golang's Goroutines. Just for fun. Yeah, nothing more.\n\n## Contributing\n\nThis project is an open-source project, and contributions from other developers are welcome. If you encounter any issues or have suggestions for improvement, please submit them on the project's GitHub page.\n\nJust kidding, please do not contribute.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fluabagg%2Fconcurrent-bogosort","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fluabagg%2Fconcurrent-bogosort","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fluabagg%2Fconcurrent-bogosort/lists"}