Lecture 22 (Edwards) - Algorithms

Lecture Date: Wednesday, April 8

Today we will continue looking at what makes a good program/algorithm, mainly looking at 3 things, how fast is it, is it easy to read, is it correct.

We will do this by considering robots and rooms, see code posted below.

After this we will talk about some algorithms that everyone who has taken a CS1 course should have seen.

illustration of type by location or by label

When is one better than the other? How do we even compare algorithms?