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

3 votes160 views3 answers
Spring xml
Java Spring
0 vote118 views1 answer
Setbackground color hexadecimal android
Java
2 votes129 views2 answers
Android settextcolor programmatically
Java
4 votes113 views1 answer
!== in javasrippt
Java
1 vote115 views1 answer
AddAll java
Java
0 vote106 views2 answers
Java wait
Java
0 vote114 views1 answer
Swagger apiimplicitparam all endpoints
Java
0 vote115 views1 answer
Java check if divisible
Java
0 vote118 views1 answer
How does plus works in Java
Java
0 vote119 views1 answer
Servlet redirect java
Java