Education For All

www.edforall.net

Text size
  • Increase font size
  • Default font size
  • Decrease font size

Programming Abstractions - Lecture 8

Get the Flash Player to view video.
Lecture 8 - Recursion

Concatenating Strings, Solving Problems Recursively, Functional Recursion, Example of Recursion: Calculating Raise to Power, Demo of "Raise to the Power Example" Through Live Coding, Mechanics of What’s Going to Happen in Recursion, More Efficient Recursion, Being Wary of Too Many Base Cases, Recursion & Efficiency, Example: Palindromes, Example: Binary Search, Binary Search Code Walk Through, Choosing a Subset; Choose Code

Julie Zelenski
CS106B Programming Abstractions
(Stanford University: Stanford Engineering Everywhere)
http://see.stanford.edu
Date accessed: 2008-12-04
License: Creative Commons Attribution 3.0

Lecture Material

To view the lecture material accompanying this lecture in a new window, please click the button below. If necessary, use the vertical or horizontal scrollbar in the new window to view more of the material or you can resize the window.

To download the above lecture material use this link. (Right-click and select Save Target As or Save Link As.)

Supplementary lecture material is listed below.

1. Assignment 3
2. Solutions for Assignment 3



 

Translate

Chinese (Simplified) French German Italian Japanese Korean Portuguese Russian Spanish
More educational resources: