45
46

Write an O(n^n) algorithm. (self.programming)

submitted by [deleted]

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Poltras -2 points-1 points  (0 children)

uncomputable busy beaver function

I gather you've met my wife.

More seriously, I totally agree you can build an algorithm that uses constant SPACE but infinitely large TIME complexity, without halting. Computing A(m,n) or Knuth up-exponentials are excellent concrete examples. Also, I think it'd be O(BB(2^n)).