What are loop cards?

Loop cards are a great game that can be played individually or as a class. They are perfect for review key vocabulary or questions at the end of a topic or when revising for an exam.

Instructions

  1. Cut out the cards from the paper horizontally (but don't cut them in half!) and then shuffle them.
  2. Now start joining each question on the right hand side of the card to the matching answer on the next card.
  3. Carry on until all the cards loop together and you have competed the game!

Hint: Make sure that you set your paper to portrait to print 4 cards per sheet of A4 paper.

Edit Vocab

The minimum amount of time an algorithm takes to run for a specific input of size n.
Worst-Case Time Complexity
The maximum amount of time an algorithm takes to run for any input of size n.
Big O Notation
A way of describing the space or time complexity of an algorithm.
O(N^2)
A time or space complexity where the amount of time or memory used grows quadratically with the size of the input.
Time Complexity
The amount of time an algorithm takes to run as a function of the input size.
Average Case
The expected amount of time or space resources required to solve a problem.
O(1)
An operation whose execution time remains unchanged regardless of input size.
Best Case
The minimum amount of time or space resources required to solve a problem.
Space Complexity
The amount of memory or storage space required by an algorithm to solve a problem.
Average-Case Time Complexity
The expected amount of time an algorithm takes to run for inputs of size n, considering all possible inputs.
Best-Case Time Complexity