Recitation Tuesday

1. Algorithm -a process or set of rules to be followed in calculations or other problem-solving

operations, especially by a computer.
2. Recursion - defining a problem in terms of itself
3. Iteration - a sequence of instructions or code being repeated until a specific end result is
achieved.
4. Algorithm specification - a finite set of instructions that, if followed, accomplishes a particular
task.
5. Recursive algorithm - a problem-solving approach that solves a problem by solving smaller
instances of the same problem.
6. Direct and indirect recursive function - a function calls itself directly in its own body. Whereas,
indirect recursion typically involves at least two functions.
7. Performance analysis - a measure of the success or failure of a project using various parameters.
8. Space complexity and its components - the total amount of memory space used by an
algorithm/program, including the space of input values for execution.

components
Auxiliary space - extra space or the temporary space that an algorithm uses.
Input space - comprises all potential sets of values for input.

9. Time complexity - a type of computational complexity that describes the time required to
execute an algorithm. The time complexity of an algorithm is the amount of time it takes for
each statement to complete.
10. Constant space complexity - it will always run in the same amount of time, no matter the input
size.
11. Linea space complexity - An algorithm that requires memory proportional to the size of the
input data has a linear space complexity. An example of a linear space complexity algorithm is
linear search.