It seems T(n) = 4/3*n^2.
You can verify this by substitution.
On Apr 1, 2:42 am, Arunachalam <arunachala...@gmail.com> wrote:
> What is the base value of this recursion? Without a base value the recursion
> is not solvable?
>
> There should be some base value like T(x) = 1 where x <= 1.
>
> regards,
> Arun.
>
>
>
> On Mon, Mar 30, 2009 at 12:35 AM, nikoo <shaker.far...@gmail.com> wrote:
>
> > Hello everybody
>
> > I need the solution to the following recursion equation
>
> > T(n) = 2 T (n/2) - 4 T (n/4) + n^2
>
> > does anybody know how to solve this equation?
> > I appreciate any help
>
> > thanks
> > nikoo
>
> --
> ===================================
> want to know more about me
> http"//ww.livejournal.com/users/arunachalam
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
