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

1 vote54 views2 answers
Javafx every second
Java
0 vote101 views2 answers
Required a bean of type 'org.springframework.mail.javamail.JavaMailSender
Java
14 votes112 views1 answer
How to print string from specific index java
Java
0 vote125 views1 answer
Java streams example
Java
0 vote147 views1 answer
How can i put infirmation of arraylist in a dropdown java
Java
2 votes106 views2 answers
System vs integration testing
Java
0 vote104 views1 answer
Java swing on close
Java
3 votes101 views3 answers
Rgb to hex java
Java
0 vote105 views1 answer
Onbackpressed fragment pass value in android
Java
1 vote118 views1 answer
Javax.xml.bind does not exist
Java