Algorithms quiz: 58 questions

58 questions from the 18 lessons of Algorithms. Each answer is explained, with a link back to the lesson it comes from, and your best score stays on this device.

Test yourself

58 questions from this course's lessons, in a random order. See what you remember, then go back to the lessons behind the questions you missed.

How many questions?

What the quiz covers

  1. Analysing algorithms (3 questions)
  2. Binary search (3 questions)
  3. Bubble, selection and insertion sort (3 questions)
  4. Merge sort (3 questions)
  5. Quick sort (3 questions)
  6. Heap sort and counting sort (3 questions)
  7. Recursion and backtracking (3 questions)
  8. Greedy algorithms (3 questions)
  9. Dynamic programming (3 questions)
  10. Knapsack and longest common subsequence (3 questions)
  11. Topological sort (3 questions)
  12. Shortest paths: Dijkstra and Floyd–Warshall (3 questions)
  13. Minimum spanning trees (3 questions)
  14. Number algorithms (3 questions)
  15. Divide and conquer and the master theorem (4 questions)
  16. String matching: naive search and KMP (4 questions)
  17. Searching grids: BFS and A* (4 questions)
  18. Bit manipulation (4 questions)