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 vote218 views1 answer
Map - counting with map
Java
0 vote233 views1 answer
Why static variables cannot be serialized in java
Java
4 votes216 views2 answers
Spigot repeating task
Java
1 vote216 views1 answer
The system cannot find the file specified in java
Java
0 vote230 views1 answer
9999999999999
Java
1 vote250 views2 answers
Android java log
Java
0 vote208 views2 answers
Convert int color to hex android
Java
0 vote206 views1 answer
If else bedingungen java
Java
0 vote193 views1 answer
Views in android
Java
8 votes213 views1 answer
See openjdk version
Java