Responsive Homepage design with Bootstrap 4 and Animate css

Simple Java Program for Function


public class HelloFunctionExample {
    public static void main(String[] args) 
     {
        // Call the function to print "Hello"
        printHello();
    }

    // Function to print "Hello"
    public static void printHello()
    {
        System.out.println("Hello");
    }
}

 

Java Program Sum of Two Numbers using Function.

 
import java.util.Scanner;

public class SumOfTwoNumbers {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter the first number: ");
        int num1 = scanner.nextInt();

        System.out.print("Enter the second number: ");
        int num2 = scanner.nextInt();

        int sum = calculateSum(num1, num2);
        System.out.println("The sum of " + num1 + " and " 
                           + num2 + " is: " + sum);

        scanner.close();
    }
    public static int calculateSum(int num1, int num2) {
        int sum = num1 + num2;
        return sum;
    }
}

Java program that calculates the power of a number using recursion.

 
public class PowerCalculation {
    public static void main(String[] args) {
        int base = 2;
        int exponent = 5;

        int result = calculatePower(base, exponent);

        System.out.println(base + " raised to the power of "
                            + exponent + " is: " + result);
    }

    // Recursive function
    public static int calculatePower(int base, int exponent) 
        {
        if (exponent == 0) {
            return 1;
        }
        return base * calculatePower(base, exponent - 1);
    }
}

Java program to print the Fibonacci series using recursion function.

 
public class FibonacciSeries {
    public static void main(String[] args) {
        int count = 10; // Number of terms 

        System.out.println("Fibonacci Series:");
        for (int i = 0; i < count; i++) {
            System.out.print(fibonacci(i) + " ");
        }
    }

    // Recursive function
    
    public static int fibonacci(int n) {
        if (n == 0)
            return 0;
        else if (n == 1)
            return 1;
        else
            return fibonacci(n - 1) + fibonacci(n - 2);
    }
}

Java Program to Find the Sum of Natural Numbers using Recursion.

 
import java.util.Scanner;

public class SumOfNaturalNumbers {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter a positive integer: ");
        int n = scanner.nextInt();









        int sum = calculateSum(n);

        System.out.println("The sum of natural numbers up to "
                            + n + " is: " + sum);

        scanner.close();
    }

    // Recursive function to calculate
       the sum of natural numbers
    public static int calculateSum(int n) {
        if (n == 0) {
            return 0;
        } else {
            return n + calculateSum(n - 1);
        }
    }
}
index