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 vote245 views1 answer
Java secureRandom certain range
Java
1 vote241 views1 answer
Java download 64-bit
Java
2 votes228 views3 answers
Jframe color
Java
0 vote237 views1 answer
Java indexof not found
Java
7 votes225 views2 answers
Java console text color
Java
0 vote253 views1 answer
List of cors headers for https
Java
1 vote209 views2 answers
Equals ignore case in java
Java
2 votes318 views3 answers
List in java
Java
1 vote236 views1 answer
How to maximize window in selenium java
Java
0 vote234 views3 answers
Varargs java
Java