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

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 …

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, …

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 …

Explore advanced computer science topics from algorithms (how we solve common computing problems and measure our solutions' efficiency), to cryptography (how we protect secret …

Unit 2: Designing algorithms with conditionals Boolean conditions Compound boolean expressions Chained conditionals Nested conditionals Making recommendations Reference docs

Course: Computer science theory > Unit 1 Lesson 8: Merge sort Divide and conquer algorithms Overview of merge sort Challenge: Implement merge sort Linear-time merging

Proof by induction is a technique that works well for algorithms that loop over integers, and can prove that an algorithm always produces correct output. Other styles of proofs can verify …

We'll translate the Pig Latin algorithm to JavaScript, since that's our language of choice on Khan Academy. We can use a for loop for the repetition, an if / else for the selection, and then a mix …

Explore advanced computer science topics from algorithms (how we solve common computing problems and measure our solutions' efficiency), to cryptography (how we protect secret …