Space Complexity: This term refers to the amount of memory or storage space that an algorithm requires to solve a problem.
Big O Notation: This notation describes the upper bound or worst-case scenario of an algorithm's time complexity.
Linear Search Algorithm: This algorithm checks each element in a list until a match is found, resulting in a time complexity proportional to the size of the list.