Learn how to use asymptotic analysis to describe the efficiency of an algorithm, and how to use asymptotic notation (Big O, Big-Theta, and Big-Omega) to more precisely describe the efficiency.
Learn the concept of recursion, a technique that is often used in algorithms. See how to use recursion to calculate factorial and powers of a number, plus to generate art.
Learn how to describe graphs, with their edges, vertices, and weights, and see different ways to store graph data, with edge lists, adjacency matrices, and adjacency lists.
Learn how to traverse a graph using breadth-first-search to find a particular node or to make sure you've visited all the nodes, traversing one layer at a time.