Question

difine recursion and give 5 example s​

Answer 1

Answer:

Some Computer related examples include: Adding a list of numbers, Computing the Fibonacci sequence, computing a Factorial, and Sudoku.

• Summing a list of numbers: ...
• Factorial. ...
• Fibonacci. ...
• Sorting. ...
• Sudoku.

plz mark as brain list

Answer 2

Answer:

Recursion. Recursion means "defining a problem in terms of itself". This can be a very powerful tool in writing algorithms. Recursion comes directly from Mathematics, where there are many examples of expressions written in terms of themselves. For example, the Fibonacci sequence is defined as: F(i) = F(i-1) + F(i-2),Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Traversals, DFS of Graph, etc..

Explanation:

If it helps then only mrk me as BRAINLIEST