This course is all about algorithms! We’ll start by looking into the concept of recursion — what does it mean for a method to call itself? Once we wrap our minds around this tricky concept, we’ll look at how to use recursion to solve some problems. Next, we’ll start to think about how we can evaluate the effectiveness of our algorithms. Finally, we’ll look at some of the most common sorting and searching algorithms. 

The Program

1. Recursion.
2. Algorithmic Complexity.
3. Searching and Sorting.