Design and Technology > QUESTION PAPER (QP) > WIA2005 Algorithm Design & Analysis Semester 2 Tutorial 2 | Download for quality grades| (All)
WIA2005 Algorithm Design & Analysis Semester 2 Tutorial 2 | Download for quality grades|
Document Content and Description Below
1. a) Using the substitution method, find the time complexity of a recursive program with the following recurrence relation: T(n) = n2+ T (n-1); n>1 = 0 ; n= 0,1 b) Outline the time analysis of t ... he following recursive programs using recursion tree method for i) T(n) = 2T(n/2) + n2 ; where n>1 ii) T(n) = T(n/3) + T(2n/3) + n; where n>1. a) Using the substitution method, find the time complexity of a recursive program with the following recurrence relation: T(n) = n2+ T (n-1); n>1 = 0 ; n= 0,1 b) Outline the time analysis of the following recursive programs using recursion tree method for i) T(n) = 2T(n/2) + n2 ; where n>1 ii) T(n) = T(n/3) + T(2n/3) + n; where n> [Show More]
Last updated: 2 years ago
Preview 1 out of 1 pages
Buy this document to get the full access instantly
Instant Download Access after purchase
Buy NowInstant download
We Accept:
Reviews( 0 )
$1.00
Can't find what you want? Try our AI powered Search
Document information
Connected school, study & course
About the document
Uploaded On
Apr 03, 2023
Number of pages
1
Written in
All
Additional information
This document has been written for:
Uploaded
Apr 03, 2023
Downloads
0
Views
119
