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 order in which the items are arranged from smallest to largest.
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.
Iteration
The process of repeating a set of instructions until a specific condition is met or a particular outcome is achieved.
Sorted Array
It is an array where the elements are arranged in increasing order.
Linear Time Complexity
A measure of time complexity in which the execution time increases linearly with the size of the input.
Worst Case
The scenario in which an algorithm takes the most amount of time to solve a given problem.
Recursion
A method for solving a problem by dividing it into progressively smaller subproblems.
In-Place Merge Sort
A variant of merge sort that does not require extra space for temporary arrays or data structures.
Search Interval
It is the range of elements in which the binary search algorithm looks for the target element.
Comparisons
The number of times two elements are compared during the sorting process.
Ascending Order