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

6 votes360 views1 answer
How to close a jframe in java with an if statement
Java
1 vote393 views1 answer
Sorting hashmap by key in java 8
Java
0 vote375 views1 answer
Google map set default zoom android studio
Java
4 votes400 views2 answers
What does the continue keyword do in java
Java
1 vote391 views1 answer
Java string count
Java
0 vote358 views1 answer
Rgb code from java color
Java
0 vote402 views1 answer
Jaccard index two vectors R
Java
0 vote396 views1 answer
Class syntax in java
Java
3 votes386 views1 answer
The shrinker may have failed to optimize the Java bytecode. To disable the shrinker, pass the `--no-shrink` flag to this command.
Java
0 vote401 views1 answer
Como ordenar un arraylist alfabeticamente en java
Java