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

It is the length of the longest path from a node to a leaf in a binary search tree.
Swaps
The number of times two elements are swapped during the sorting process.
In-Place Sorting
A sorting algorithm that rearranges the original array without using additional memory.
List
An ordered collection of data.
O(N)
The notation used to indicate linear complexity, where n is the size of the input.
Out-Of-Place Sort
A sorting algorithm that necessitates extra memory in order to arrange the array.
Unordered
A list that is not sorted according to any specific criterion.
Best-Case Performance
The time or space complexity of an algorithm when it receives the best input possible.
Iteration
The process of repeating a set of instructions until a specific condition is met or a particular outcome is achieved.
Average-Case Scenario
The scenario in which an algorithm's execution time falls between the best-case and worst-case scenarios.
Height