Jump to content

Time complexity


esti

Recommended Posts

Hi,

 

I'm struggling with these 2 questions:

post-102122-0-91025800-1384643665_thumb.jpg

 

 

I'm trying to understand what should i prove here and what is the approach for solving that?

 

Q1: both expressions are O(nlogn) ?

Q2: ??

 

 

Tnx,

Shimon

 

 

 

Link to comment
Share on other sites

my natural logs are rusty, but if i recall:

 

[math]ln(e^{e^k})=e^k[/math]

[math]ln(e^k)=k[/math]

[math]ln\left( e^{e^k}\right)^k=ln(e^{e^k*k})=e^k*k[/math]

 

so second relationship should therefore be:

[math]e^k*k, e^{e^k*k}[/math]

 

(feel free to check all that though)

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.