Printable Flashcards

Checking two adjacent elements to decide if they should be swapped to sort the list in order.	A sorting method that repeatedly swaps adjacent elements to arrange a list in order.
The process of repeating a set of instructions until a specific condition is met or a particular outcome is achieved.	The speed and effectiveness with which a task is completed, measured in terms of time and resources used.
An algorithm that sorts data by rearranging elements within the original structure using minimal extra memory.	The process of exchanging two items in a list or array.
The measure of memory an algorithm requires relative to input size during problem-solving and subproblem breakdown.	The measure of how an algorithm's running time grows as the size of its input increases.

The time or space complexity of an algorithm when it receives the best input possible.	The maximum time or memory an algorithm requires when processing the most challenging input within problem solving.
The process of improving the performance of an algorithm by reducing its time or space complexity.	The expected time or space an algorithm requires when processing typical inputs based on their likelihood.
An arrangement of data where values increase from the smallest to the largest, used in sorting algorithms.	A single data value stored within a collection used to organize information in algorithms and problem solving.
An algorithm that preserves the relative order of equal elements during sorting.	An arrangement of items starting with the highest value, used to organize data for efficient problem solving.