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 list or array one item at a time in a linear fashion.
Stable Sort
A sorting algorithm that preserves the relative order of equal elements in the sorted output.
Comparison
The process of checking two items and determining which one is greater or smaller than the other.
Runtime
The time taken to execute an algorithm or program.
Merge Function
The central component of the merge sort algorithm is the function that combines two sorted subarrays. Its primary goal is to merge these arrays.
Complexity
A measure of how much time and/or space is required to execute an algorithm or program.
Quadratic Time Complexity
A time complexity that grows proportionally with the square of the input size.
In-Place Merge Sort
A variant of merge sort that does not require extra space for temporary arrays or data structures.
Worst-Case Scenario
The scenario in which an algorithm takes the longest time to complete.
Binary Search
Algorithm that searches a sorted list or array by repeatedly dividing in half until the desired item is found.
Sequential Search