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

A sorting algorithm that does not require extra space for temporary arrays or data structures.
Average Case
The scenario in which an algorithm takes an average amount of time to solve a given problem.
Recursive
A function or algorithm that calls itself with a smaller version of the problem until a base case is reached.
Merge
The process of combining two or more sorted sub-arrays into a single sorted array.
Comparisons
The number of times two elements are compared during the sorting process.
Recursion
A method for solving a problem by dividing it into progressively smaller subproblems.
Swaps
The number of times two elements are swapped during the sorting process.
Worst Case
The scenario in which an algorithm takes the most amount of time to solve a given problem.
Stable Sort
A sorting algorithm that preserves the relative order of equal elements in the sorted output.
Merge Sort
Algorithm that divides an array into sub-lists, sorts the sub-lists, and then merges them back together in sorted order.
In-Place Sorting