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 vote172 views1 answer
Spigot bukkit self cancelling task timer example repeat times
Java
3 votes155 views1 answer
Find maven version
Java
0 vote187 views1 answer
Java how to open a link
Java
0 vote174 views1 answer
Keytool error: java.io.FileNotFoundException: my-release-key.keystore (Access is denied) java.io.FileNotFoundException: my-release-key.keystore (Access is denied)
Java
-1 vote176 views4 answers
Android date time
Java
4 votes162 views2 answers
Java klasse
Java
0 vote182 views1 answer
Generate uuid from string
Java
0 vote235 views1 answer
Operation sur les dates java
Java
0 vote292 views1 answer
How to add a note in java
Java
0 vote189 views1 answer
What singleton java spring
Java Spring