Concept of recursion using factorial in java

public class P_07_recursion_factorial
{ 
    static int factorial(int n)
    {     
          if (n == 1)     
            return 1;     
          else     
            return(n * factorial(n-1));     
    }       
public static void main(String[] args)
{ 
System.out.println("Factorial of 5 is: "+factorial(5)); 
} 
}

Output :

Comments

Post a Comment

Popular posts from this blog

Program to illustrate the concept of templates.

Image
#include<iostream> using namespace std; template <class t> void display(t x) { cout<<"Displaying function of template : "<<x<<endl; } void display(int x) { cout<<"Explicit Display function : "<<x<<endl; } int main() { display(200); display(12.05); display('a'); cout<<"\n/*\nName-Sanjampreet Singh\nRoll Number-1507967\n*/"; } Output:
Read More »

To configure the IP address for a computer connected to LAN

Include the following source Code in Document Environment in your LaTeX File \begin{document} \newpage \section{\emph{To configure the IP address for a computer connected to LAN}} \subsection{\emph{Whai is IP Address?}} \begin{figure}[h] \centering \includegraphics[scale=0.2]{ip} \caption{IP Address logo} \end{figure} IP address is a unique string of numbers separated by full stops that identifies each computer using the Internet Protocol to communicate over a network.\\ \subsection{To Configure IP Address For Windows} \begin{enumerate} \item Click on the Windows Key on your Keyboard and Press X. On the menu that appears click control panel. \begin{center} \includegraphics[scale=0.45]{2-1} \end{center} \item In Category view click on Network and Internet. \begin{center} \includegraphics[scale=0.5]{2-2} \end{center} \item Click on Network and Sharing Center. \begin{center} \includegraphics[scale=0.5]{2-3} \end{center} \item Click on Change Adapter Settings. ...
Read More »

Write a menu driven program to perform insertion and deletion operations in a single linked list

Image
#include<iostream> using namespace std; struct node { int info; struct node *link; }*start; class test { node *create_node(int); public: test() { start=NULL; } void insert_beg(); void insert(); void del(); void display(); }; node *test::create_node(int val) { node *temp; temp=new(struct node); if(temp==NULL) { cout<<"\nMemory not allocated\n"; } else { temp->info=val; temp->link=NULL; return temp; } } void test::insert_beg() { int val; node *temp,*s; cout<<"Enter the value:"; cin>>val; temp=create_node(val); s=start; if(start==NULL) { start=temp; temp->link=NULL; } else { temp->link=start; start=temp; } cout<<"\nNode Inserted!!\n"; } void test::insert() { int pos,val,count=0; node *temp,*s,*ptr; cout<<"\nEnter the position:"; cin>>pos; cout<<"\nEnter the value...
Read More »