| Algorithm |
A step-by-step procedure or formula for solving a problem or completing a task. |
| Array |
A data structure that contains a group of elements, typically of the same data type, in a contiguous memory location. |
| In-Place Sorting |
A type of sorting algorithm that requires a minimal amount of additional memory space to sort the data. |
| Quadratic Time Complexity |
A classification of algorithm efficiency where the time taken to complete the task grows proportionally to the square of the input size. |
| Selection Sort |
A simple sorting algorithm that divides the input list into a sorted and an unsorted region, repeatedly selecting the smallest element from the unsorted region and moving it to the sorted region. |
| Time Complexity |
A computational complexity that describes the amount of time it takes to run an algorithm as a function of the length of the input. |
| Unsorted Region |
The portion of the list that has not yet been sorted, from which elements are selected to be moved to the sorted region. |
