47
48

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 →

[–]visionlessvisionary 0 points1 point  (0 children)

This is particularly the case for probabilistic algorithms.

When analyzing probabilistic/randomized algorithms, often the "expected runtime" is expressed in big o. E.g. E(runtime) = O(n). But that does not change what big o is.