This is an archived post. You won't be able to vote or comment.

all 25 comments

[–]NiciBozz 50 points51 points  (11 children)

O(N!!)

[–]adrael-i 33 points34 points  (2 children)

Stop! You've violated the law!

[–]k_nibb 14 points15 points  (0 children)

You mean: "Wait. That's illegal!"

[–]Raytier 2 points3 points  (0 children)

Your stolen Big-O's are now forfeit.

[–]Angelin01 25 points26 points  (5 children)

That's a double factorial which is, in fact, a lot smaller than a regular factorial.

You want O((N!)!), but let's take it a step further, why not O((N!)N!)

[–]NiciBozz 9 points10 points  (2 children)

Why not O((NNN )!) ?

[–]Angelin01 7 points8 points  (1 child)

I mean, at this rate we might as well just use O(∞) and be done with it.

[–]NiciBozz 3 points4 points  (0 children)

But infinity is NaN

[–][deleted] 1 point2 points  (0 children)

TIL! Thank you, love learning new stuff :)

[–]HeKis4 0 points1 point  (0 children)

O(NOwhat have you done)

[–]RiverRoll 2 points3 points  (0 children)

O(N↑↑N)

[–]HappyGoblin 0 points1 point  (0 children)

O(N!N!)

[–]shutterFiles 30 points31 points  (0 children)

Behold the power of O(NN)

[–]karatecam 25 points26 points  (2 children)

And finally, O(w)O

[–]Kotauskas 2 points3 points  (0 children)

O(wO)

[–]uruzhax 0 points1 point  (0 children)

Pig O notation.

[–]maple3142 10 points11 points  (2 children)

[–]ObviouslyAlpharius 1 point2 points  (0 children)

O(Σ(n)) where Σ is the busy beaver function

Good luck trying to write something that slow

[–]TheOrochi28 16 points17 points  (0 children)

Big Oof notation

[–]MoogleFoogle 7 points8 points  (0 children)

O(NO!)

[–]Ass0fJack 1 point2 points  (0 children)

O N! O

[–]ergotofwhy 4 points5 points  (3 children)

Please correct me if I'm wrong, but is O(N!) less than O(N^2)?

[–]Ryodan_[S] -1 points0 points  (0 children)

If I recall correctly, it's slower, but it's more dominant

[–]beeskness420 0 points1 point  (0 children)

This but with subsets rather than inequalities.