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 …

Now pseudocode is probably a word you've never heard before but basically, it's code that looks a lot like English or really, whatever language you like to talk in. Well, okay, that may not make sense so …

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 …

Unit 6: HTML/JS: Making webpages interactive Get ready to make your webpages interactive JS and the DOM DOM access methods DOM modification DOM events DOM animation Using JS libraries in …

Let's play a little game to give you an idea of how different algorithms for the same problem can have wildly different efficiencies. The computer is going to randomly select an integer from 1 to 15.

Addition and subtraction greater than 1000 Learn Relate place value to standard algorithm for multi-digit addition

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 …

The course mastery system is a basic algorithm: It presents questions (tagged with what practice they're from), and at the end it goes through all the practices and ups your level by on the ones you did good …

Learn how to code computer programs, how to design algorithms that make computers more efficient, and discover what a career in computing could look like.