In the recursion tree method of solving recurrence equations.. why do we try to find an upper bound on the number of leaves (or the total cost of the leaf nodes). In most of the recursion tree examples we usually find the level by level sum to infinity.. what's the role of the number of leaves there ?
Esmerelda
0
Light Poster
rubberman
1,355
Nearly a Posting Virtuoso
Featured Poster
Haven't read your text book I presume?
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.