Question

not sure if this should be math or computer science:

Answer 1

let k be a natural number constant. Suppose you have two algorithms that solve the same problem with running times f(n) = k*n^k and g(n) = 2^n.

Prove \[f \in O(g)\]

Answer 2

This is definitely a computer science question.

Answer 3

okay thanks

Answer 4

No problemo. :)

Answer 5

Computer science is a subset of math, so yeah. Hehe.