News for hackers. Stuff that matters.
Re:How Inefficient Can a Sort Algorithm Be? (2012) [pdf] by kevinwang on Tuesday March 19, 2019 @12:51PM (#19432635)
I think it may be another factor of n slower than that

Edit: wow nevermind, I just read the paper linked to bozo sort in wikipedia. They conjecture that it's O(n!) whereas bogosort is Omega(n*n!). Wow, that's surprising!

There are no comments on this comment yet.