in Algorithms edited by
584 views
0 votes
0 votes

Which of the following represents the running time for run (n) function?

  • O(log n)
  • O(log (log (n))
  • O(log ∗ (n))
  • O(n)

sombody please provide explanation 

in Algorithms edited by
584 views

4 Comments

I understand the reasoning behind log* n but does anybody has  any proper mathematical proof
0
0
i too think answer should be C.

and recurrence should be T(n) =2Tlogn + c..RIGHT??

as two times run(log n) is called.

i am not sure of that extra paranthesis
0
0
no recurrence should be T(2logn) +c i.e T(logn)+c

BTW according to geniouses at made easy answer is O(n) :P
0
0

1 Answer

0 votes
0 votes
Solving By Back Substitution  I am getting O(log n )

1 comment

i don't think it should be log n can you show the steps
0
0