{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# 11-recursion - ENG 1D04 Fall 2010 11 Recursion Dr William M...

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

ENG 1D04 Fall 2010 11 Recursion Dr. William M. Farmer and Dr. Spencer Smith Faculty of Engineering, McMaster University 22 November 2010

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

View Full Document
Outline 1. Administrative details. 2. Advice 3. Review 4. Recursion. 5. ENG 1D04. 6. Demo. 7. Work plan for weeks 10 and 11. W. M. Farmer and S. Smith ENG 1D04 Fall 2010: 11 Recursion 2/19
Administrative Details W. M. Farmer and S. Smith ENG 1D04 Fall 2010: 11 Recursion 3/19

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

View Full Document
Advice 1. Develop a study plan for the final exam! See the work plan for the final exam session. Schedule time during the exam period for the study plan. 2. Keep a portfolio! A portfolio is a collection of your work that you can show to employers (as well as to your family and friends). Put polished versions of your best work into your portfolio. W. M. Farmer and S. Smith ENG 1D04 Fall 2010: 11 Recursion 4/19
Review 1. Algorithms. 2. Euclid’s GCD algorithm. 3. Search Algorithms. 4. Sorting Algorithms. W. M. Farmer and S. Smith ENG 1D04 Fall 2010: 11 Recursion 5/19

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

View Full Document
What is Recursion? Recursion is a method of defining something (usually a function) in terms of itself. One of the most fundamental ideas of computing. An alternative to iteration (loops). Can make some programs easier to describe, write, and prove correct. In Python and most other programming languages, functions can be defined by recursion.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}