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 vote295 views1 answer
Processing pi
Java
1 vote280 views1 answer
Java discord bot get id of message it just sent
Java
2 votes293 views1 answer
Loop hash map
Java
2 votes279 views1 answer
Android get list element by index
Java
0 vote288 views1 answer
How to draw a triangle in java
Java
0 vote292 views1 answer
Resource leak: 'scanner' is never closed
Java
0 vote270 views1 answer
ORM for Android
Java
1 vote269 views1 answer
Fabricmc spawn item
Java
1 vote303 views1 answer
Tuple in java
Java
0 vote288 views1 answer
Set java time complexity
Java