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 vote340 views1 answer
Java quotes in string
Java
118 votes419 views6 answers
Java int to string
Java
0 vote343 views2 answers
How to use asynx task to make api connection java
Java
89 votes407 views5 answers
Split in java
Java
0 vote336 views1 answer
Aws s3 compatible java
Java
0 vote349 views1 answer
Java socket connect to gmail
Java
11 votes320 views4 answers
Circular imageview android
Java
0 vote328 views1 answer
How to mutate value in vector in java
Java
4 votes344 views1 answer
How to check if recyclerview is empty
Java
1 vote317 views2 answers
Format localdate java
Java