Lecture Data Structures & Algorithms: Chapter 2 - Function & Recursion presented Function, the Concept Of Stack, the Sequence Of Execution During A Function Call, Parameter Passing & Call By Reference, Resolving Variable References, Recursion, Stack Overheads In Recursion, Writing A Recursive Function, Types Of Recursion. | Data Structures & Algorithms 1 Function & Recursion 1. Function 2. The Concept Of Stack 3. The Sequence Of Execution During A Function Call 4. Parameter Passing & Call By Reference 5. Resolving Variable References 6. Recursion 7. Stack Overheads In Recursion 8. Writing A Recursive Function 9. Types Of Recursion 1. FUNCTION Provide modularity to the software Divide complex tasks into small Manageable tasks Avoid duplication of work int sumOfArray(int M[] , int n) { int nSum=0; for(int i=0;i
