algorithms, including searching, sorting, recursion, and graph theory Learn how to describe graphs, with their edges, vertices, and weights, and see different AlgorithmsFurther learningSelection sortAsymptotic notation
algorithms, including searching, sorting, recursion, and graph theory Learn how to describe graphs, with their edges, vertices, and weights, and see different Further learningAlgorithmsDivide and conquer algorithmsUnit 2: Cryptography
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 AlgorithmsFurther learningSelection sortDivide and conquer algorithms
About this unit
We've partnered with Dartmouth college professors Tom Cormen and Devin Balkcom to teach introductory computer science algorithms Intro to algorithms
What are algorithms and why should you care Binary search
Learn about binary search, a way to efficiently search an array of items by halving the search space each time Asymptotic notation
Learn how to use asymptotic analysis to describe the efficiency of an algorithm, and how to use asymptotic notation (Big O, Big-Theta Selection sort
Learn selection sort, a simple algorithm for sorting an array of values, and see why it isn't the most efficient algorithm Insertion sort
Learn insertion sort, another simple but not very efficient way to sort an array of values Recursive algorithms
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 Towers of Hanoi
Use the recursive technique to solve the Towers of Hanoi, a classic mathematical puzzle and one reportedly faced by monks in a temple Merge sort
Learn merge sort, a more efficient sorting algorithm that relies heavily on the power of recursion to repeatedly sort and merge sub-arrays 