Jump to content

Time complexity

Featured Replies

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

 

 

 

First one is easy ∑ log(k) (k=1,n) compared to nlog(n). Obviously nlog(n) is bigger.

 

Second is a little confusing, Left term exponent. What is it the exponent of: argument of ln or ln of argument?

  • Author

 

Second is a little confusing, Left term exponent. What is it the exponent of: argument of ln or ln of argument?

 

Yep, I am also confused with that - need to check

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)

Archived

This topic is now archived and is closed to further replies.

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.

Configure browser push notifications

Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.