Actually I'm not sure I have any O(n!) algorithms. There are two places I could have. One of them I capped n, the other I sped up to 2^n n^2
-
@propensive Gosh no. n! is ridiculously superexponential. It's like n^n with some tiny baby exponential dampening factor.
@DRMacIver And a little actual thought rather than vague memory says, "yeah, you're obviously right".
-
-
@propensive Yeah, it's easy to see that for n > m you have n! > m! m^{n - m}, so n! grows faster than any exponential. -
@DRMacIver Yep. I quit maths for compsci after two years. It was "vague" before, and has remained so, alas. (And likely always will, now.)
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.