2. Recurrence solution methods
{"Image DocumentName": "2. Recurrence solution methods", "Image ImageDescription": "Recursion-tree Example. The recurrence is. T (n) = 3T (\u230an/4\u230b) + \u0398(n2) = 3T (n/4) + cn2. Use the recursion tree to making a good guess for upper bound for the solution.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}