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
Bukkit dev paid account
Java
0 vote112 views2 answers
Android Execution failed for task ':app:processReleaseManifest' Could not get unknown property 'manifestOutputDirectory' for task
Java
0 vote105 views1 answer
Java calendar add minutes
Java
0 vote116 views2 answers
Package javafx.fxml does not exist
Java
0 vote71 views1 answer
List Double, fixed size
Java
0 vote129 views1 answer
Spring security auto login after register
Java
-1 vote138 views1 answer
React-cheat-sheet
Java
0 vote112 views1 answer
Plus One Java
Java
0 vote111 views1 answer
Java how to make a 2d eclipse
Java
0 vote127 views1 answer
Joining an array of strings in java
Java