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 a position in an array where an element is located.
Mid-Point
It is the point in the search interval that divides it into two equal halves.
Target Element
It is the element being searched for in the binary search algorithm.
Pre-Order Traversal
It is a traversing method for binary search trees where the root is visited first, followed by the left and right subtrees recursively.
Binary Search Tree
It is a data structure that allows fast searching, insertion and deletion of elements, using the binary search algorithm on a sorted tree.
Divide And Conquer
A problem-solving strategy that involves breaking a problem into smaller sub-problems, solving them independently and combining their solutions.
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.
Time Complexity
It is the amount of time taken by an algorithm to run as a function of the size of the input.
Iteration
It is the repetition of a process in order to achieve a desired outcome, usually with the aim of approaching a goal in small steps.
Node
It is a fundamental unit of a binary search tree that contains a value and links to its children.
Index