Lectures

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 24, 25.

We saw how to handle errors in previous lecture. But now that we have classes, we can do so much more. This is why we are going to revist the topic.    More ›

This lecture references Lesson 25.

This lecture combines while-loops and classes to show how to make complex graphical applications. This lecture will provide you all that you need to know to get started on the last assignment.    More ›

This lecture references Lesson 24.

While there is still much to say about classes, today we take a break to cover one last form of iteration: the while-loop. We need to cover this in order for you to complete the current assignment.    More ›