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 variant of merge sort that does not require extra space for temporary arrays or data structures.
Logarithmic Time Complexity
The time complexity that demonstrates a gradual increase in time required with an increase in input size, following a logarithmic pattern.
In-Place Sorting
A sorting algorithm that does not require extra space for temporary arrays or data structures.
Stable Sort
A sorting algorithm that preserves the relative order of equal elements in the sorted output.
Comparison-Based Sort
A sort algorithm that looks at the elements of the array to be sorted to determine their relative order.
Out-Of-Place Sort
A sorting algorithm that necessitates extra memory in order to arrange the array.
Average Case
The scenario in which an algorithm takes an average amount of time to solve a given problem.
Time Complexity
The amount of time an algorithm takes to solve a problem as a function of the size of the input.
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.
Comparisons
The number of times two elements are compared during the sorting process.
In-Place Merge Sort