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 vote276 views1 answer
Treemap java entryset
Java
0 vote298 views1 answer
Isblank vs isempty java string utils
Java
10 votes229 views1 answer
How to get 2 decimal places in java
Java
1 vote263 views1 answer
How to close the fragment by a close button in android
Java
0 vote264 views2 answers
Beurre
Java
0 vote271 views1 answer
Javafx listview of objects
Java
2 votes279 views2 answers
How to upgrade java 8 to 11 in ubuntu
Java
0 vote276 views1 answer
2d matrix multiplication
Java
0 vote309 views1 answer
How to load template file from resource folder in spring boot project
Java Spring
2 votes254 views1 answer
Character.getNumericValue['z']
Java