Answers
A smaller list created by splitting a larger list during a sorting method.
A measure of how well an algorithm uses resources such as time and memory to complete a task.
A complete run through a list during a sort, where each item is checked with its neighbour.
A total count of two items being examined against each other during a sort, used to measure performance.
A method splits a list into smaller parts, orders them, and then joins them into one ordered list.
An operation that checks whether one item is greater than, less than, or equal to another item.
The action of exchanging the positions of two items in a list during a sort.
A method repeatedly checks adjacent items and exchanges them if they are in the wrong order.