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 vote217 views1 answer
Eclipse jvm version 11 or greater is required
Java
1 vote208 views1 answer
Null checker on addAll java
Java
0 vote200 views1 answer
Java dictionary array initialization
Java
4 votes210 views2 answers
Update alternatives java
Java
0 vote226 views1 answer
Fakultät in java
Java
0 vote232 views1 answer
Java array multidimensional hashcode
Java
0 vote201 views2 answers
Rsa java
Java
0 vote206 views1 answer
Rgb code from java color
Java
1 vote201 views2 answers
Scanner_Java
Java
0 vote238 views2 answers
Csv file data structure java
Java