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

Algorithm that searches a sorted list or array by repeatedly dividing in half until the desired item is found.
Worst Case
The scenario in which an algorithm takes the most amount of time to solve a given problem.
Quadratic Time Complexity
A time complexity that grows proportionally with the square of the input size.
In-Place Sorting
A sorting algorithm that rearranges the original array without using additional memory.
Runtime
The time taken to execute an algorithm or program.
Boolean
A data type that can have one of two possible values, usually true or false.
Node
It is a fundamental unit of a binary search tree that contains a value and links to its children.
Stable Sort
A sorting algorithm that preserves the relative order of equal elements in the sorted output.
Descending Order
A sorting order in which the items are arranged from largest to smallest.
Stable Sorting
A sorting algorithm that keeps the original order of elements with equal values.
Binary Search