Saturday 24 March 2018

Recursion

Recursive function is a function that calls itself. When a function calls another function and that second function calls the third function then this kind of a function is called nesting of functions.But a recursive is the function that calls itself repeatedly.

A simple example :
main ( )
{
printf (" this is an example of recursive function");
main( );
}
 when this program is executed.The line is printed repeatedly and indefinitely.We might have to abruptly terminate the execution.

/*Program to calculate Factorial of a number */
#include <stdio.h>
void calc_factorial (int);  //function prototype
void calc_factorial (int i)
{
int I, factorial_number = 1;
for (i = 1; I < = n; ++i)
   factorial_number *=I;
printf("The factorial of %d is %d\n", n, factorial_number);
}
int main(void)
{
int number = 0;
printf(" Enter a number\n");
scanf("%d",&number);
calc_factorial (number);
return 0;
}

Sample Program Output
  Enter a number
     3
   The factorial of 3 is 6

0 Comments:

Post a Comment

Popular Posts

Categories

AI (27) Android (24) AngularJS (1) Assembly Language (2) aws (17) Azure (7) BI (10) book (4) Books (120) C (77) C# (12) C++ (82) Course (63) Coursera (181) Cybersecurity (24) data management (11) Data Science (97) Data Strucures (6) Deep Learning (10) Django (6) Downloads (3) edx (2) Engineering (14) Excel (13) Factorial (1) Finance (6) flutter (1) FPL (17) Google (19) Hadoop (3) HTML&CSS (46) IBM (25) IoT (1) IS (25) Java (92) Leet Code (4) Machine Learning (46) Meta (18) MICHIGAN (5) microsoft (4) Pandas (3) PHP (20) Projects (29) Python (765) Python Coding Challenge (255) Questions (2) R (70) React (6) Scripting (1) security (3) Selenium Webdriver (2) Software (17) SQL (40) UX Research (1) web application (8)

Followers

Person climbing a staircase. Learn Data Science from Scratch: online program with 21 courses