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

3 votes211 views3 answers
Spring mvc
Java
6 votes184 views4 answers
Install java on ubuntu 20.04
Java
1 vote207 views1 answer
Comparable
Java
0 vote199 views1 answer
Authentication in spring boot
Java Spring
0 vote215 views2 answers
Compare date with current date in android
Java
0 vote187 views1 answer
Java replace all space with underscore
Java
0 vote166 views1 answer
Reset status bar color in android
Java
1 vote232 views1 answer
Entre clavier java
Java
2 votes181 views2 answers
Split each character in a string (java)
Java
3 votes171 views5 answers
Convert java code to kotlin online editor
Java