https://github.com/luabagg/concurrent-bogosort
Concurrent Bogosort generates permutations of its input until it finds one that is sorted
https://github.com/luabagg/concurrent-bogosort
bogosort concurrency goroutines ordering-algorithms
Last synced: 5 months ago
JSON representation
Concurrent Bogosort generates permutations of its input until it finds one that is sorted
- Host: GitHub
- URL: https://github.com/luabagg/concurrent-bogosort
- Owner: luabagg
- License: mit
- Archived: true
- Created: 2023-09-25T04:02:34.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-06-25T04:12:32.000Z (almost 2 years ago)
- Last Synced: 2024-06-27T05:08:08.331Z (almost 2 years ago)
- Topics: bogosort, concurrency, goroutines, ordering-algorithms
- Language: Go
- Homepage: https://pkg.go.dev/github.com/luabagg/concurrent-bogosort
- Size: 97.7 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: readme.md
- License: LICENSE
Awesome Lists containing this project
README
# Concurrent Bogosort
## What is Bogosort?
Bogosort, also known as permutation sort, stupid sort, slow sort, shotgun sort or monkey sort is a particularly ineffective algorithm one person can ever imagine.
It is based on generate and test paradigm. The algorithm successively generates permutations of its input until it finds one that is sorted.
## How does Concurrent Bogosort works?
This code opens a new goroutine sequentially, applying the bogosort technique until one matches a sorted array.
At the end of the execution, you can see the number of opened goroutines.
## WHY?
This is just a study of Golang's Goroutines. Just for fun. Yeah, nothing more.
## Contributing
This 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.
Just kidding, please do not contribute.