This document discusses recursive functions, which are functions that call themselves repetitively until a certain condition is satisfied. It provides an introduction to recursive functions, noting that they contain statements to determine if the function should call itself again, a function call with arguments, a conditional statement like if/else, and a return statement. It then provides two examples of recursive functions as class work: writing a program to find the product of two numbers recursively and writing a program to calculate a^b recursively.

1. INTRODUCTION
EXAMPLE
Recursive Function

2. Introduction
 Recursive functions are those function which are call
themselves repetitively.
 The function call themselves repetitively until certain
condition is satisfied.
 The recursive function have following types of
statements:
 A statement or condition to determine if the function is calling
itself again.
 Function call which should have argument
 Conditional statement(if-else)
 A return statement.

4. OUTPUT

5. Class Work
 WAP to find the product of two numbers using
recursion.
 WAP to find a^b using recursion.