This preview shows page 1. Sign up to view the full content.
Unformatted text preview: f ( n ) = n i =1 n 2 ). Give a recursive deFnition of f . 2) Give a recursive algorithm for Fnding the maximum of a Fnite set of integers. 1...
View Full Document
This note was uploaded on 08/11/2008 for the course MATH 240 taught by Professor Miller during the Fall '08 term at Wisconsin.
- Fall '08