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 vote147 views1 answer
Quicksort for arraylist
Java
0 vote148 views1 answer
Current time in long java
Java
0 vote127 views1 answer
Free pearson uk textbooks
Java
2 votes132 views1 answer
Appcompatdelegate.setdefaultnightmode(appcompatdelegate.mode_night_yes) not working
Java
1 vote122 views1 answer
Latest dependency for snackbar android
Java
0 vote160 views1 answer
C:\elastic stack\elasticsearch-7.15.1-windows-x86_64\elasticsearch-7.15.1\bin>java -version java version "1.8.0_311" Java(TM) SE Runtime Environment (build 1.8.0_311-b11) Java HotSpot(TM) Client VM (build 25.311-b11, mixed mode, sharing)
Java
1 vote129 views1 answer
Android push notification icon
Java
26 votes130 views4 answers
Loop list java
Java
0 vote135 views1 answer
How to remove duplicate elements from char array in java
Java
0 vote131 views1 answer
Another name for coffee
Java