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 range of elements in which the binary search algorithm looks for the target element.
Leaf
It is a node in a binary search tree that has no children.
Stable Sort
A sorting algorithm that preserves the relative order of equal elements in the sorted output.
Linear Time Complexity
A measure of time complexity in which the execution time increases linearly with the size of the input.
Recursion
A method for solving a problem by dividing it into progressively smaller subproblems.
Binary Search
Algorithm that searches a sorted list or array by repeatedly dividing in half until the desired item is found.
In-Order Traversal
It is a traversing method for binary search trees where the left subtree is recursively traversed, followed by the root, and then the right subtree.
In-Place Sort
A sort algorithm that arranges the elements of an array without needing any extra memory for sorting.
Merge
The process of combining two or more sorted sub-arrays into a single sorted array.
In-Place Sorting
A sorting algorithm that rearranges the original array without using additional memory.
Search Interval