/sci/ - Science & Math

[Anonymous No.8701578]

I need some known non trivial algorithms that run in O(2^n^2) or O(2^n^4). tnx

[Anonymous No.8701629]

>>8701578
O(2^n) is for example a recursive fibonacci, figure the rest out yourself.

[Anonymous No.8701654]

>>8701629

wow so helpful

[Anonymous No.8701667]

>>8701654

What an ingrate.

[Anonymous No.8701703]

>>8701578
Homework threads go on >>>/hm/

[Anonymous No.8701818]

>>8701629
What a retard.

1) The shit you proposed is naive as fuck, and OP especially asked for a nontrivial algorithm.
2) You can solve fibonacci in O(n) and even in O(log n).
3) You can create a recursive version out of any algorithm.

[Anonymous No.8701829]

>>8701629
Recursive fibonacci is [math]O \left(2^{2^n} \right) [/math].

[Anonymous No.8701969]

>>8701703

kill yourself retard, this isn't homework, pls kill yourself and don't forget to kill yourself you fucking subhuman trash

[Anonymous No.8703167]

>>8701829
http://stackoverflow.com/questions/360748/computational-complexity-of-fibonacci-sequence

[Anonymous No.8703481]

Do the homewo.... oh wait your a CS Major.

[Anonymous No.8703688]

Dude, just print everything from 1 to 2^n^2.

[Anonymous No.8703712]

>>8703688
kek

[Anonymous No.8703717]

>>8703167
He took [math]n[/math] to be the number of bits used to represent the input. Any sane computer scientist would do that when the input is a simple integer.

[Anonymous No.8703790]

>>8703688
i was gonna say this

OP, this question is not answerable if you don't say what counts as a "non-trivial" algorithm

[Anonymous No.8704192]

>>8703688
Somehow I feel that this is wrong but I don't know why it's wrong.