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

1 vote172 views3 answers
How to sort arraylist in java
Java
1 vote141 views1 answer
Check the string has spaces in it in java
Java
0 vote152 views1 answer
Convert two bytes to int java
Java
0 vote136 views1 answer
Number of zeros in a binary array
Java
125 votes313 views5 answers
Random java
Java
0 vote132 views1 answer
Spring cli version
Java
2 votes135 views1 answer
Java string vs stringbuilder
Java
6 votes130 views5 answers
Max of an array java
Java
5 votes132 views2 answers
This in java
Java
1 vote145 views1 answer
Calculate pi in java
Java