We've partnered with Dartmouth college professors Tom Cormen and Devin Balkcom to teach introductory computer science algorithms, including searching, sorting, recursion, and graph theory.

By understanding algorithms, we can make better decisions about which existing algorithms to use and learn how to make new algorithms that are correct and efficient. An algorithm is made up of three …

Ultimately, most algorithms become code that actually runs on a computer. Before that happens, programmers often like to express an algorithm in pseudocode: code that uses all the constructs of a …

Learn to define algorithms, express them in flow chart and pseudocode, and assess their correctness and efficiency. See how algorithms can be used as shortcuts to solve problems that can't be solved …

Tom and Devin will teach you many of the algorithms that you would learn in APCS or CS 101, like searching algorithms, sorting algorithms, recursive algorithms and my personal favorite, graph …

Begin your journey into computational problem-solving. This unit introduces you to algorithms and their representation.

One way to come up with approximate answers to a problem is to use a heuristic, a technique that guides an algorithm to find good choices. When an algorithm uses a heuristic, it no longer needs to …

Given the same algorithm, the iterative version will generally be faster than the recursive version. The big reason is function calls (used in recursion) are expensive operations.

Discover selection as you design algorithms that allow the computer to decide which code to run and when. Learn how to evaluate boolean expressions and construct conditionals to add branching logic …

What is an algorithm? Use algorithms to plan out your programs, and evaluate approaches to a problem based on correctness, efficiency, and readability. Explore how to use selection in your algorithms to …