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 time or space complexity of an algorithm when it receives the worst input possible.
Best Case
The scenario in which an algorithm takes the least amount of time to solve a given problem.
Linear Time Complexity
A measure of time complexity in which the execution time increases linearly with the size of the input.
Recursion
A method for solving a problem by dividing it into progressively smaller subproblems.
Comparison-Based Sort
A sort algorithm that looks at the elements of the array to be sorted to determine their relative order.
Search Interval
It is the range of elements in which the binary search algorithm looks for the target element.
Traversing
It is the process of visiting all the nodes in a binary search tree in a specific order, such as in-order, pre-order and post-order.
Average-Case Performance
The time or space complexity of an algorithm when it receives average inputs.
In-Place Sort
A sort algorithm that arranges the elements of an array without needing any extra memory for sorting.
Search
The process of finding a specific value within an array or list.
Worst-Case Performance