Is this statement true and why?(time complexity)

StackOverflow https://stackoverflow.com/questions/22971127

  •  30-06-2023
  •  | 
  •  

سؤال

I am having a really hard time understanding these so please help me so I may get an example, so I can get a chance to solve more of those. I have tried many different way but none seem to be able to come to a result, my guess is that it is wrong and it is O(n) but I cannot prove it.

//Is this statement true and why? 
 square_root(n5) log(square_root(n5)) = O(n3)
هل كانت مفيدة؟

المحلول

Following the steps below would help you deduce the result discussed in the question.

enter image description here

Because:

enter image description here

With an appendix:

enter image description here

مرخصة بموجب: CC-BY-SA مع الإسناد
لا تنتمي إلى StackOverflow
scroll top