https://github.com/probably-not/schedsort
A brilliant sorting algorithm that uses Go's high-performance concurrency primitives to sort in parallel
https://github.com/probably-not/schedsort
Last synced: 11 months ago
JSON representation
A brilliant sorting algorithm that uses Go's high-performance concurrency primitives to sort in parallel
- Host: GitHub
- URL: https://github.com/probably-not/schedsort
- Owner: probably-not
- Created: 2022-05-15T06:17:35.000Z (about 4 years ago)
- Default Branch: main
- Last Pushed: 2022-05-15T06:31:51.000Z (about 4 years ago)
- Last Synced: 2025-06-03T20:18:20.537Z (about 1 year ago)
- Language: Go
- Size: 6.84 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Codeowners: .github/CODEOWNERS
Awesome Lists containing this project
README
# schedSort
A brilliant sorting algorithm that uses Go's high-performance concurrency primitives to sort in parallel.
As all of you know, Go is a high-performance language with very powerful concurrency primitives.
But, some of you may not know, that Go's standard library barely uses these primitives, such as in it's sort package.
My sorting algorithm uses Go's scheduler and goroutines to do all of the sorting with goroutines and waitgroups.
## Notes
This is a joke sorting algorithm, and the whole README is a joke.
It's based on a stupid idea that I had to try and see how random Go's scheduler is.
Please do not use this in production or take any of what is written here as the truth.