- 1 (10.69 KiB) Viewed 27 times
3. Show that the solution for T(n)=T(n)+Θ(1) is T(n)=Θ(lglg(n)) 4. Draw the recursion tree for T(n)=T(43n)+T(An)+Θ(n)
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
3. Show that the solution for T(n)=T(n)+Θ(1) is T(n)=Θ(lglg(n)) 4. Draw the recursion tree for T(n)=T(43n)+T(An)+Θ(n)
3. Show that the solution for T(n)=T(n)+Θ(1) is T(n)=Θ(lglg(n)) 4. Draw the recursion tree for T(n)=T(43n)+T(An)+Θ(n) and find the height of the tre