Homework Assignment #5


To analyze divide-and-conquer recursive algorithms using linear, homogeneous recurrence relations with constant coefficients.


Show all work. i.e., justify your answers.

Exercises in the Recurrence Relations notes, Part I (Section 1.2) . [Three questions: 1 point each for the parts of question 1, 3 points each for questions 2 and 3]

cs-312/hw5.txt · Last modified: 2015/01/23 13:50 by ringger
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0