'Multiple base cases' presentation slideshows

CS203 Lecture 2

CS203 Lecture 2 . John Hurley Cal State LA. Recursion. Recursion is the technique of breaking down a problem into smaller instances of the same problem. In programming, a recursive algorithm is one that directly or indirectly invokes itself direct recursion: methodA calls methodA

688 views • 61 slides

Writing LISP functions

Writing LISP functions. COND. Rule 1: Unless the function is extremely simple, begin with a COND If you can write the function body in one line, do it. If it's more complicated, use COND to break it into cases. NULL.

287 views • 15 slides

Warm-up Problem

190 views • 11 slides

MA/CSSE 473/474

MA/CSSE 473/474. How (not) to do an induction proof. Reminder of some simple logic. A ?B (A implies B) means that whenever A is true, B is true also. The only way A ? B can be false is when A is true and B is false . The inverse, B ? A, is not the same as A ? B.

159 views • 9 slides