Buildout@lemmy.worldtoProgrammer Humor@lemmy.ml•Not everything can be done in constant time, that's O(k)
6·
5 months agoT = O(n) means that there exists a single constant k such that T < kn for all sufficiently large n. Therefore O(n!^2) is not the the same as O(n!), but for example both 10n!, 10000n!, n! + n^2 (note the plus) are O(n!).
Another way to think about this: suppose you believe that O(n) and O(n^2) are distinct. Now plug in only numbers that are factorials (2, 6, 24, …).
This game informed a lot of my early musical tastes and probably contributed to my current tastes in one way or another.