Analysis of complexity

Question

The increasing order of following functions in terms of asymptotic complexity is:

(a) f1(n); f4(n); f2(n); f3(n)                                            (b) f1(n); f2(n); f3(n); f4(n)

(c) f2(n); f1(n); f4(n); f3(n)                                            (d) f1(n); f2(n); f4(n); f3(n)

Comments

f4()

---

check properly for n =  1000000000,

f4(n) > f2(n)

btw what about n = 10000000000000000000000 ??

no matters what Quadratic func  win the race at some particular range

---

Got it. Most importantly got the reasoning. Thanks!