Ascending Order |
A sorting order in which the items are arranged from smallest to largest. |
Average-Case Performance |
The time or space complexity of an algorithm when it receives average inputs. |
Best-Case Performance |
The time or space complexity of an algorithm when it receives the best input possible. |
Bubble Sort |
Algorithm that repeatedly compares adjacent items in a list or array and swaps them until everything is sorted. |
Comparison |
The process of checking two items and determining which one is greater or smaller than the other. |
Descending Order |
A sorting order in which the items are arranged from largest to smallest. |
Efficiency |
The speed and effectiveness with which a task is completed, measured in terms of time and resources used. |
Element |
An individual item in a list or array. |
In-Place Sorting |
A sorting algorithm that rearranges the original array without using additional memory. |
Iteration |
The process of repeating a set of instructions until a specific condition is met or a particular outcome is achieved. |
Optimization |
The process of improving the performance of an algorithm by reducing its time or space complexity. |
Space Complexity |
The amount of memory used by an algorithm as the input size increases. |
Stable Sorting |
A sorting algorithm that keeps the original order of elements with equal values. |
Swapping |
The process of exchanging two items in a list or array. |
Time Complexity |
The amount of time it takes to complete a task as the input size increases. |
Worst-Case Performance |
The time or space complexity of an algorithm when it receives the worst input possible. |