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
Cut out the cards from the paper horizontally (but don't cut them in half!) and then shuffle them.
Now start joining each question on the right hand side of the card to the matching answer on the next card.
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.
A mathematical notation used to describe the upper bound of the time complexity of an algorithm as the input size approaches infinity.
Average Case
The scenario in which an algorithm takes an average amount of time to solve a given problem.
Post-Order Traversal
It is a traversing method for binary search trees where the left and right subtrees are first recursively traversed, followed by the root.
Divide And Conquer
A problem-solving strategy that involves breaking a problem into sub-problems, solving each sub-problem independently, and then combining the solutions to solve the original problem.
Logarithmic Time Complexity
The time complexity that demonstrates a gradual increase in time required with an increase in input size, following a logarithmic pattern.
Element
An individual item in a list or array.
Iteration
The process of repeating a set of instructions until a specific condition is met or a particular outcome is achieved.
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.
Recursive
A function or algorithm that calls itself with a smaller version of the problem until a base case is reached.
Node
It is a fundamental unit of a binary search tree that contains a value and links to its children.