7. What is a function?

Functions are "self-contained" modules of code that accomplish a specific task. Functions usually
"take in" data, process it, and "return" a result. Once a function is written, it can be used over and
over and over again. Functions can be "called" from the inside of other functions.

19.Give the differences between recursion Iteration

and iteration. Recursion
Function calls itself until the base condition is
reached.
Only base condition (terminating condition) is
specified.
It keeps our code short and simple.
It is slower than iteration due to overhead of
maintaining stack.
It takes more memory than iteration due to
overhead of maintaining stack.
Repetition of process until the condition fails.
It involves four steps: initialization, condition,
execution and updation.
Iterative approach makes our code longer.
Iteration is faster.
Iteration takes less memory.

20. What are advantages and disadvantages Disadvantages

of recursion? Advantages
Recursive functions make the code look clean
and elegant.
A complex task can be broken down into
simpler sub-problems using recursion.
Sequence generation is easier with recursion
than using some nested iteration.
Sometimes the logic behind recursion is hard to
follow through.
Recursive calls are expensive (inefficient) as
they take up a lot of memory and time.
Recursive functions are hard to debug.