First time here? Checkout the FAQ!
+1 vote

When analyzing a recurrence of the form T(n) = a T(nb) + θ(nc), under which of the following conditions can we conclude that “most of the work occurs at the leaves of the recursion tree”?

  1.   c <loga
  2.   c = logb a
  3.   c > logb a
  4.   None of these


asked in Algorithms by Veteran (14.8k points) 15 151 316 | 76 views

1 Answer

+1 vote
Best answer

Answer: Option (A)

  • Case 1: f(n) is O(nlogba - ε). Since the leaves grow faster than f, asymptotically all of the work is done at the leaves, and so T(n) is Θ(nlogb a).
  • Case 2: f(n) is Θ(nlogba). The leaves grow at the same rate as h, so the same order of work is done at every level of the tree. The tree has O(lg n) levels, times the work done on one level, yielding T(n) is Θ(nlogb a lg n).
  • Case 3: f(n) is Ω(nlogba + ε). In this case we also need to show that af(n/b)≤kf(n) for some constant k and large n, which means that f grows faster than the number of leaves. Asymptotically all of the work is done at the root node, so T(n) is Θ(f(n)).
answered by Loyal (3.1k points) 1 10 27
selected by
could'nt understand much..can u explain bit more??

Yeah Sure !!!

  • See, the first  Case, it says if the value of θ(nc) is less then the Value computed by the Entire aT(nb).
  • Means , the root works θ(nc) and the children especially the Leaves work  Θ(nlogba).
  • (Simply applied Master's Theorem)
  • And relation we get is  θ(nc)<Θ(nlogba).
  • And that is nothing but c< logba.
  • So option A is correct.
  • Hope you are clear!!!

@Akriti, ma'am this might clear your concept.

T(n)=2T(n/2) + n2.

The recursion tree for this recurrence is of the following form:


and the children / leaves work O(n).

It is Case 2.

Just choose the answer if you get it as "Best" !!!! :)

@jason,i am understanding all the things ,you are sayng but .just tell me this-"

"Means , the root works θ(nc) and the children especially the Leaves work  Θ(nlogba)."

the recurrence is T(n) = a T(nb) + θ(nc) which means n is divided into n/b at each level.right?and at each level nc work is done..right?so how is that leaves do more or less work?overall work at all the levls will be same.right??

and pls dun call me ma'am..i am also a student like you..;):-P

MAY be i am getting u now.suppose T(n) =2T(N/2) + n2


                           n                        n2

                       /        \

                    n/2        n/2               (n/2)2 + (n/2)2 

at,next level (n/4)2 + (n/4)2 + (n/4)2 + (n/4)2

hence,at leaves,work done is less.

am i right??

thanks jason..:)

Exactly Ma'am that work will be very less compared to the Work done by the Root.

Related questions

+1 vote
2 answers
asked in Algorithms by vishal8492 Junior (811 points) 2 17 31 | 495 views
+1 vote
1 answer
asked in Algorithms by अनुराग पाण्डेय Veteran (13.4k points) 22 58 133 | 1.5k views

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users Oct 2017
  1. Arjun

    23398 Points

  2. Bikram

    17078 Points

  3. Habibkhan

    8264 Points

  4. srestha

    6296 Points

  5. Debashish Deka

    5438 Points

  6. jothee

    4978 Points

  7. Sachin Mittal 1

    4772 Points

  8. joshi_nitish

    4348 Points

  9. sushmita

    3964 Points

  10. Rishi yadav

    3804 Points

Recent Badges

Notable Question KISHALAY DAS
Notable Question sh!va
Notable Question abhijeetbzu
Great Question jothee
Popular Question rahul sharma 5
Nice Question mohit kumar 5
Notable Question rishu_darkshadow
Nice Comment Pranay Datta 1
Copy Editor Shivansh Gupta
Nice Comment KULDEEP SINGH 2
27,324 questions
35,176 answers
33,279 users