2·
9 months agoTechnically, sleep sort is O(n), so faster than the theoretical optimal sorting algorithm O(n.log n) … not so bad ;)
- 0 Posts
- 3 Comments
Joined 2 years ago
Cake day: June 25th, 2023
You are not logged in. If you use a Fediverse account that is able to follow users, you can follow this user.
The morons… Why use a computer if you don’t have full power?
obligatory reference
https://piped.video/watch?v=S3XBb5ghzSw