Skip to main content

What is recursive function ? Write a C program using recursion for calculating factorial of an integer


Answer:

The process in which a function in turn calls itself is
called recursion. And the function is called recursive function.

When a called function in turn calls another function again and again the
process of this calling is called recursion.



An example is given below:

#include<stdio.h>
#include<conio.h>
int fact(int n);
void main()
{
int n,f;
clrscr();
printf ("Input the value of n: ");
scanf ("%d", &n);
f=fact (n);
printf ("Factorial: %d", f);
getch();
}
 int fact(int n)
{
 int p;
if(n==1)
return 1;
else
p=n*fact(n-1);
return p;
}

Simple Output:

Input the value of n: 5

Factorial: 120

Popular posts from this blog

Draw the basic organization of computer

Answer:                 The basic organization of computer__ Input Unit: ·          It accepts (or reads) instructions and data from outside. ·          It converts these instructions and data in computer acceptable form ·          It supplies the converted instructions and data to the computer system for further processing. Central Processing Unit (CPU): Control Unit: Control unit of a computer system manages and coordinates the operations of all other components of the computer system. Arithmetic Logic Unit(ALU): Arithmetic logic unit of a computer system is the place, where the actual executions of instruction, takes place during processing operation. Storage Unit: Primary Memory: It is volatile ( loses data on power ...

Differences between positional and non-positional number system?

Answer: Positional Number System: In positional number system, there are only a few symbols called digits, and these symbols represent different values depending on the position they occupy in the number. The value of each digit in such a number is determined by three considerations__ 1.       The digit. 2.       The position of the digit in the number. 3.       The base of the number system.