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

2 votes194 views1 answer
Java string replace character at position
Java
0 vote195 views1 answer
Calling this in constructor java
Java
0 vote191 views1 answer
How to check if rs next is null
Java
11 votes196 views2 answers
Java generics
Java
1 vote184 views1 answer
Exception in thread "main" java.lang.noclassdeffounderror: org/apache/commons/logging/logfactory
Java
0 vote249 views1 answer
Android-edittext allow only characters and numbers
Java
8 votes182 views1 answer
How to get float value in json java
Java
1 vote191 views1 answer
Why java is secure
Java
0 vote196 views1 answer
Reponse entity as result spring controller
Java
0 vote192 views1 answer
No data type for node: org.hibernate.hql.internal.ast.tree.IdentNode \-[IDENT] IdentNode:
Java