Lecture 8 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.
Julie talks about solving problems recursively. She covers functional recursion with the simple example of writing an exponential function using recursion. From the simple program performing as an exponential function Julie continues to show a more efficient recursion code. The next example she covers is that of binary search and how recursion is used in this instance.
Complete Playlist for the Course:
CS 106B Course Website:
Stanford Center for Professional Development:
Stanford University Channel on YouTube:
Tagged under: computer,science,technology,software,engineering,++,programming,language,lecture,recursion,functional,palindrome,binary,search
Clip makes it super easy to turn any public video into a formative assessment activity in your classroom.
Add multiple choice quizzes, questions and browse hundreds of approved, video lesson ideas for Clip
Make YouTube one of your teaching aids - Works perfectly with lesson micro-teaching plans
1. Students enter a simple code
2. You play the video
3. The students comment
4. You review and reflect
* Whiteboard required for teacher-paced activities
With four apps, each designed around existing classroom activities, Spiral gives you the power to do formative assessment with anything you teach.
Carry out a quickfire formative assessment to see what the whole class is thinking
Create interactive presentations to spark creativity in class
Student teams can create and share collaborative presentations from linked devices
Turn any public video into a live chat with questions and quizzes