Lecture07

# Lecture07 - Recursion Many problems can be formulated...

This preview shows pages 1–4. Sign up to view the full content.

CS2134 Recursion Many problems can be formulated recursively: fact(n) = 1*2* . .. *n fact(n) = 1 if n = 0 n*fact(n-1) if n > 0 recursive definitions translate easily into recursive C++ functions: int fact(int n)    {// pre : n >= 0       if (n==0) return 1;       return n*fact(n-1);    }

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
CS2134 Recursion Examples Recursive Binary Search Recursive printing : if n <= 9 print n else print n/10 then print n%10 (last digit) (More generally . .. change of base) Recursive Max Contiguous Subsequence Simpler than O(n) algorithm O(n log n) Lots of recursive sorting algorithms (later)
CS2134 Principles of Recursion Divide and Conquer Base Case Always make progress toward base case Move computation that is needed in every instance into driver To reason about correctness, use mathematical induction: assume recursive calls solve small instances and use this to prove that program handles large instance correctly.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 12/09/2009 for the course CS 2134 taught by Professor Hellerstein during the Spring '07 term at NYU Poly.

### Page1 / 6

Lecture07 - Recursion Many problems can be formulated...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online