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 vote385 views2 answers
Write code to declare an array that will hold calendar months (.e. January to December) java
Java
0 vote343 views1 answer
Java lamda
Java
3 votes378 views1 answer
Check if string is only white space java
Java
0 vote421 views1 answer
Spring boot eureka , zual hystrix, rest api docs
Java Spring
2 votes339 views3 answers
Java.lang.NoClassDefFoundError:
Java
0 vote322 views1 answer
Barcode design in postgresql
Java
5 votes386 views2 answers
Java print type of object
Java
0 vote329 views1 answer
Java modulus opperation
Java
1 vote356 views1 answer
Object to array java
Java
0 vote386 views1 answer
Make handler running continuously
Java