PRACTICE QUESTIONS > T-2005-02- Tutorial 2 (1).docx
University of Malaya WIA 2005 WIA2005 Algorithm Design &Analysis Semester 2 Tutorial 2 1.a) Using the substitution method, find the time complexity of a recursive programwith the following recurrence relation:T(n) = n2+ T (n-1); n>1= 0 ; n= 0,1b) Outline the time analysis of the following recursive programs usingrecursion tree method fori)T(n) = 2T(n/2) + n2; where n>1 ...[Show More]
Preview 1 out of 1 pages
Reviews( 0 )
| Category: | PRACTICE QUESTIONS |
| Number of pages: | 1 |
| Language: | English |
| Last updated: | 1 year ago |
| Downloads: | 1 |
| Views: | 0 |
-preview.png)
