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 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.
In-Place Merge Sort
A variant of merge sort that does not require extra space for temporary arrays or data structures.
Big-O Notation
A mathematical notation used to describe the upper bound of the time complexity of an algorithm as the input size approaches infinity.
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.
Comparison-Based Sort
A sort algorithm that looks at the elements of the array to be sorted to determine their relative order.
Stable Sort
A sorting algorithm that preserves the relative order of equal elements in the sorted output.
Quadratic Time Complexity
A time complexity that grows proportionally with the square of the input size.
Logarithmic Time Complexity
The time complexity that demonstrates a gradual increase in time required with an increase in input size, following a logarithmic pattern.
Best Case
The scenario in which an algorithm takes the least amount of time to solve a given problem.
Comparisons
The number of times two elements are compared during the sorting process.