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 time an algorithm takes to solve a problem as a function of the size of the input.
Space Complexity
The amount of memory an algorithm requires to solve a problem as a function of the size of the input.
Worst Case
The scenario in which an algorithm takes the most amount of time to solve a given problem.
Merge Function
The central component of the merge sort algorithm is the function that combines two sorted subarrays. Its primary goal is to merge these arrays.
Average Case
The scenario in which an algorithm takes an average amount of time to solve a given problem.
In-Place Sorting
A sorting algorithm 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.
Merge Sort
Algorithm that divides an array into sub-lists, sorts the sub-lists, and then merges them back together in sorted 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.
Comparison-Based Sort
A sort algorithm that looks at the elements of the array to be sorted to determine their relative order.