OpenAha
00
All courses
Math · Intermediate

Algorithms

An algorithm is a precise recipe for solving a problem. Discover why binary search is so fast, watch a sorting algorithm at work, learn to compare algorithms with big-O notation, see when greedy choices fail, meet the million-dollar P versus NP question, find shortest routes with Dijkstra's algorithm, and solve problems with dynamic programming.

7 lessons~40 min0/7 complete
Start courseHelpful background: Powers & Roots
1

Searching and Sorting

Classic algorithms.

  1. SearchingLinear versus binary search
  2. SortingBubble sort versus merge sort
2

How Hard Is It?

Growth rates and hard problems.

  1. Big-O NotationComparing growth rates
  2. Hard ProblemsThe travelling salesperson and P vs NP
3

Algorithm Design

Shortest paths and dynamic programming.

  1. Shortest PathsHow sat-navs find the best route
  2. Dynamic ProgrammingNever solve the same problem twice
  3. Hash TablesFinding things in one step

Courses that build on this

Ready for more? These courses use what you learn in Algorithms.

Math · Advanced

Computability

Program the simplest possible computer, build automata, and discover questions no computer can ever answer.

7 lessons3 chapters