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

1 vote179 views2 answers
String.indexof java
Java
1 vote186 views1 answer
Failed to apply plugin [class 'com.google.gms.googleservices.GoogleServicesPlugin']
Java
0 vote212 views1 answer
How to put array in array list stack overflow
Java
2 votes163 views2 answers
How to run java program with external jar files in command prompt
Java
0 vote176 views1 answer
Stack overflow recyclerview
Java
2 votes167 views1 answer
Java union type
Java
0 vote202 views1 answer
Webview send to console android
Java
0 vote211 views1 answer
Java dictionary initialization
Java
0 vote183 views1 answer
Return type of executebatch in java
Java
106 votes186 views6 answers
Switch en java
Java