Search the courses, subjects, tracks, games and features, or jump straight to a page.
4 cards from this section. Quick, good the night before a test.
What is an algorithm?
Think about a recipe that outlines exactly how to cook something.
List one characteristic of an algorithm.
Consider what makes something a valid algorithm.
What is the primary purpose of an algorithm?
Consider what we want algorithms to achieve in programming.
True or False: A brute force algorithm always guarantees the best solution.
Think about whether trying every single option is always the fastest way to find the best one.
Design an algorithm to find the shortest path between two points on a map using dynamic programming.
Think about how many routes you could take and how to choose the most efficient one.
Implement a backtracking algorithm to solve a Sudoku puzzle.
Imagine placing a number as a temporary commitment; if it doesn’t work, you can erase and try another.
6 more questions in this section. Enroll free to practise them all.
Enroll free