Recursion in data structure

@Recursion is a process in which a function calls itself as a subroutine. This allows the function to be repeated several times.
@Recursion property
@Tower of Hanoi

1. Objective of presentation Define recursion and it’s property Example of recursion Tower of Hanoi and it’s algorithm Example of tower of Hanoi.

2. Recursion Recursion is a process in which a function calls itself as a subroutine. This allows the function to be repeated several times.

3. R ecursion property Recursive procedure must have the following two properties: There must be certain criteria, called base criteria. Each time the procedure does call itself,it must be closer to the base criteria.

4. E xample of recursion Factorial function The product of positive integer from 1 to n is called “n factorial”. If N=0 then, When N=1 F N =1 F 1 =1*F 1-1 2) If N>0 then, F 1 =1* F F N =N* F N-1 F 1 =1 When N=0 Similarly,F 2 =2 F = 1 F 3 =6

5. T ower of Hanoi Tower of Hanoi is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. Following rules: .Only one disk must be moved at a time. No disk may be placed on top of a smaller disk The minimum number of moves required to solve a Tower of Hanoi

6. A lgorithm General notation Tower(N,BEG,AUX,END) if N>0 then Move ( N-1 ,BEG ,END ,AUX) BEG END TOWER(1,BEG,AUX,END) Move ( N-1 ,AUX ,BEG ,END) Return.

7. E xample of tower of Hanoi

8. E xample

9. E nd of the presentation Thank YOU