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 sorting algorithm that rearranges the original array without using additional memory.
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.
Average-Case Scenario
The scenario in which an algorithm's execution time falls between the best-case and worst-case scenarios.
Merge Sort
Algorithm that divides an array into sub-lists, sorts the sub-lists, and then merges them back together in sorted order.
Descending Order
A sorting order in which the items are arranged from largest to smallest.
Complexity
A measure of how much time and/or space is required to execute an algorithm or program.
Best Case
The scenario in which an algorithm takes the least amount of time to solve a given problem.
Array
A collection of elements of the same data type, stored in contiguous memory locations.
List
An ordered collection of data.
Binary Search
Algorithm that searches a sorted list or array by repeatedly dividing in half until the desired item is found.