2 multiples recursion

import java.util.Scanner;

public class multipied {
    public static Scanner scanner = new Scanner (System.in);
    public static void main(String[] args) {
        System.out.println("Enter int");
        int n = scanner.nextInt();
        int sum = 1;
        System.out.println("For loop");
        for(int i = 0 ; i < n ; ++i ){
            if(n == 0){
                System.out.println(sum+'\n');
                break;
            }
            sum*=2;
        }
        System.out.println(sum);
        int r = multipied(n);
        System.out.println("\nRecursive");
        System.out.println(r);
        ;

    }

    public static  int multipied(int n){

        if(n ==0)
            return 1;

        return 2 * multipied(n-1);
    }

}

Similar codes

0 vote150 views1 answer
How to generate increasing random numbers in java
Java
19 votes156 views6 answers
Java array to list
Java
0 vote141 views1 answer
Macros in java
Java
0 vote151 views1 answer
Findng and replacing duplicate values in an array
Java
0 vote218 views1 answer
UserRedirectRequiredException: A redirect is required to get the users approval spring boot 5 security
Java Spring
0 vote181 views1 answer
Java longest paldrome
Java
1 vote146 views1 answer
Java transfer file over socket
Java
0 vote139 views1 answer
What isz meaning of EL in jsp
Java
0 vote205 views1 answer
How to calculate angle difference
Java
0 vote159 views1 answer
Java convert edittext to double
Java