Recursive functions need a base case to ensure that the recursion ends; otherwise, they will run indefinitely, which is not what you want. The basic case is the scenario in which the function doesn’t recur. The base case, for instance, is when we attempt to use recursion to get the factorial of a number and our number ends up being less than 1.

The formula used to get a number’s factorial is an illustration of a recursive function.

int factorial(int n){
    if (n == 0 || n == 1){
        return 1;
    }
    return n * factorial(n - 1);
}

The post Recursion first appeared on Student Projects.

main()
{
    int n,a[50],key,opn,i,pos;
    do
    {
        clrscr();
        printf(" \n\n Press 1 -> Binary Search , 2-> Towers of Hanoi 3-> Quit\n");
        scanf("%d",&opn);
        switch(opn)
        {
        case 1: printf(" How Many Elements?");
            scanf("%d",&n);
            printf(" Read all the elements is ASC order \n");
            for(i=1;i<=n;i++)
                scanf("%d",&a[i]);
            printf(" Read the Key Element\n");
            scanf("%d",&key);
            pos=BS(a,key,1,n);
            if(pos)	 printf(" Success: %d found at %d \n", key,pos);
            else	 printf(" Falure: %d Not found in the list ! \n",key);
            break;
        case 2: printf("\n\n How Many Disks ?");
            scanf("%d", &n);
            printf("\n\n Result of Towers of Hanoi for %d Disks \n",n);
            tower(n,'A','B','C');
            printf("\n\n Note: A-> Source, B-> Intermediate, C-> Destination\n");
            break;
        case 3: printf(" Terminating \n"); break;
        default: printf(" Invalid Option !! Try Again !! \n");
        }
        printf(" Press a Key. . . ");  getch();
    }while(opn != 3);
}
int BS(int a[], int key,int low,int high)
{
    int mid;
    if(low > high) return 0; /* failure */
    else
    {
        mid=(low+high)/2;
        if(a[mid]== key) return mid; /* Success */
        if(key < a[mid]) return(BS(a,key,low,mid-1));
        return(BS(a,key,mid+1,high));
    }
}
tower(int n, char src, char intr, char dst)
{
    if(n > 0)
    {
        tower(n-1,src,dst,intr);
        printf("Move disk %d from %c to %c \n", n,src,dst);
        tower(n-1,intr,src,dst);
    }
}

The post C Program for Binary Search and Towers of Hanoi using Recursion first appeared on Student Projects.

#include
#include
void main()
{
	int n,fact;
	int rec(int); clrscr();
	cout<<"Enter the number:->";
	cin>>n;
	fact=rec(n);
	cout<
The post C++ program to calculate the factorial of a number using recursion. first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/c-program-to-calculate-the-factorial-of-a-number-using-recursion/feed/
			20
		
		
			
		
		
		https://studentprojects.in/software-development/java/java-programs/basic/java-program-to-print-fibonacci-sequence/
					https://studentprojects.in/software-development/java/java-programs/basic/java-program-to-print-fibonacci-sequence/#comments
		
		
		Fri, 02 Oct 2009 14:50:28 +0000
				
		
		
		
		
		
		
		http://studentprojects.in/?p=850

					Write a Java program that uses both recursive and non-recursive functions to print nth value in the Fibonacci sequence.

The post Java program to print Fibonacci sequence first appeared on Student Projects.
]]>
										Write a Java program that uses both recursive and non-recursive functions to print nth value in the Fibonacci sequence

Without recursion:
import java.util.Scanner;
class fibonacci
{
	public static void main(String[] input)
	{
		int x,y;
		x=Integer.parseInt(input[0]);
		y=Integer.parseInt(input[1]);
		Scanner s=new Scanner(System.in);
		System.out.println(“Enter the value of n:”);
int n=s.nextInt();
		int z[]=new int[n];
		z[0]=x;
		z[1]=y;
		for(int i=2;i
With recursion:
import java.util.Scanner;
class fibonacci
{
	public static void main(String[] args)
	{
		Scanner s=new Scanner(System.in);
		System.out.println(“Enter the value of n:”);
		int n=s.nextInt();
		fiboni f1=new fiboni();
		System.out.println(f1.fibon(n));
	}
}
class fiboni
{
	public int fibon(int a)
	{
		if(a==0 || a==1)
			return 1;
		else
			return fibon(a-1)+fibon(a-2);
	}
}

Output:
10
1

1

2

3

5

8

13

21

34

55
The post Java program to print Fibonacci sequence first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/java/java-programs/basic/java-program-to-print-fibonacci-sequence/feed/
			7