Recursion-breaking an object down into smaller objects of the same typeis a ma- jor theme in mathematics and computer science. For example, in an induction proof we establish the truth of a statement()from the truth of the statement P(n-1). In pro- gramming, a recursive algorithm solves a problem by applying itself to smaller instances
Lectures available on the web(short version) For over-enrollment please go to the Physics office P107 Laboratory sessions start next week go to my web site w. phys. uconn. edu/-rcote Syllabus+ homeworks lectures, etc WebAssign: ready Friday night gotowww.webassign.netandlogin )username: first letter of first name plus last name