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 vote112 views2 answers
How to use asynx task to make api connection java
Java
10 votes128 views2 answers
How to substring in java
Java
1 vote98 views1 answer
Java parallel sort
Java
0 vote95 views1 answer
Java resto
Java
0 vote96 views1 answer
Get frequency of letters java
Java
0 vote110 views2 answers
LinkedList java
Java
0 vote93 views1 answer
Not allowed to bind to service Intent
Java
0 vote102 views1 answer
Spring boot access images in resources folder
Java
1 vote109 views1 answer
Java list addAll stream() filtereted
Java
6 votes215 views6 answers
Java foreach map
Java