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.
The amount of memory used by an algorithm as the input size increases.
Height
It is the length of the longest path from a node to a leaf in a binary search tree.
Linear Search
Algorithm that searches for a specific element in a list or array by checking each element one at a time.
Index
A position number indicating the location of an element within an array or list.
Sorted Array
It is an array where the elements are arranged in increasing order.
Pseudocode
An informal high-level description of the operating principle of a computer program is a non-specific outline that summarizes how the program functions.
In-Place Merge Sort
A variant of merge sort that does not require extra space for temporary arrays or data structures.
Average Case
The scenario in which an algorithm takes an average amount of time to solve a given problem.
Linear Time Complexity
A measure of time complexity in which the execution time increases linearly with the size of the input.
Target Element
It is the element being searched for in the binary search algorithm.