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 vote327 views2 answers
Control flow graph generator
Java
6 votes292 views3 answers
JOptionpane
Java
0 vote327 views1 answer
Find center of screen graphic g
Java
58 votes243 views8 answers
Array with java
Java
-1 vote304 views1 answer
1.13. programacion orientada a objetos en java
Java
1 vote311 views1 answer
How to install java 8 on aws linux
Java
0 vote320 views2 answers
Calculate smallest angle difference
Java
0 vote361 views1 answer
Java android development find element by id
Java
17 votes315 views2 answers
Java constructor
Java
2 votes353 views1 answer
Copy collection java
Java