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 vote177 views1 answer
Intellij evaluate expression
Java
0 vote179 views1 answer
Delete Specials Caractères from a String in java
Java
0 vote194 views1 answer
Java url
Java
0 vote164 views1 answer
Java boilerplate
Java
0 vote193 views1 answer
Period java springboot
Java Spring
0 vote168 views1 answer
Math.log java
Java
0 vote166 views1 answer
Java get parent process name
Java
1 vote159 views1 answer
Clsoe keyboard android studio
Java
0 vote168 views1 answer
Spring security antmatchers id
Java
3 votes169 views1 answer
Check if object in array java
Java