Lectures

This lecture references .

This is the video for the review session for generators and coroutines. It also includes the question-and-answer session afterward.    More ›

This lecture references .

Hopefully you have enjoyed this course. Assuming that you have, today we discuss your options about what to do next in computer science.    More ›

This lecture references Videos 30.6-30.8.

In the previous lecture, we talked about sorting, but the algorithms we introduced were pretty slow. In this lecture we show how to use recursion to create better sorting algorithms.    More ›

This lecture references Videos 30.1-30.5.

In this lecture we end with a preview of what higher-level computer science courses look like. We talk about the concept of sorting, and given an in-depth look at some of the algorithms available.    More ›

This lecture references Lesson 29.

Generators are a specific example of a concept known as coroutines. In this lecture we go into more detail on coroutines and show how they are used in the final assignment.    More ›