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 vote276 views1 answer
Android studio lower case letters on a button
Java
0 vote298 views1 answer
Eclipse versioning .classpath
Java
0 vote331 views1 answer
Webmvctest vs springboottest
Java
0 vote304 views2 answers
Raspberry stackexchange how to install the java jdk
Java
0 vote285 views1 answer
Find duplicate value in array java
Java
0 vote306 views1 answer
How to load template file from resource folder in spring boot project
Java
0 vote288 views1 answer
Why String is popular HashMap key in Java?
Java
1 vote327 views3 answers
Change drawable color programmatically android
Java
3 votes294 views1 answer
How to randomize an array java
Java
1 vote278 views1 answer
Rwegex java
Java