News for hackers. Stuff that matters.
Re:Learn Big-O and stop hacking your way through algorithms by taeric on Thursday August 20, 2020 @06:30PM (#24229786)
Amusingly, it isn't that simple. 5000n will be larger than n! for several n, after all.

And it is often worth realizing that often you can shave time for space, but the setup costs aren't zero. Nor do you always have the space to setup. (For fun in this vein, lookup sortation networks.)

There are no comments on this comment yet.