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

4 votes321 views2 answers
Generate random string in java
Java
0 vote394 views1 answer
Javafx list view does not update
Java
0 vote337 views1 answer
Fix the indentation java
Java
7 votes378 views1 answer
Android join array
Java
0 vote340 views1 answer
Split() String android
Java
-1 vote308 views1 answer
$CATALINA_HOME/RUNNING.txt
Java
1 vote345 views1 answer
Java swing absolute position
Java
0 vote329 views1 answer
Android studio lower case letters on a button
Java
2 votes372 views1 answer
How to make java list
Java
0 vote347 views3 answers
Power of a number in java
Java