How to solve this recurrence relation
T(n)= 3 T(n/2) + n lgn
I am not convinced that we can apply Master method.And thus when i solve it using iterative approach i am stuck in logarithmic series formed in above.any help would be appreciated.
| CodeGuru Home | VC++ / MFC / C++ | .NET / C# | Visual Basic | VB Forums | Developer.com |
|
Results 1 to 8 of 8
Thread: Recurrence relation problemThreaded View
|
Click Here to Expand Forum to Full Width |