in Algorithms edited by
445 views
0 votes
0 votes

Consider the two functions (logn)k  and  nϵ, where k>1 and ϵ>0. 

The solution is (logn)k= O(nϵ). 

My doubt is that if we take ϵ as0.000000000000000000000000000000.......000000000001 that is very small wont this result be wrong??

Can someone check?

in Algorithms edited by
445 views

4 Comments

(logn)k= (nϵ)

Take log both side 

k. loglogn = ϵ logn 

so k. loglogn = O(ϵ.logn)  means  k. loglogn$\leqslant$ C ϵ.logn [ here c is some constant]

1
1
but ϵ  can be fraction lie 0.00000000000000000000000000000000000000...........1. will it not make ϵ log n very small?
0
0
constant C will take care of it. C can be 10000000........000000000000000000
0
0
oh yeah wow awesome. thanku so much for the explanation.
0
0

Please log in or register to answer this question.

Related questions