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 votes130 views2 answers
Java scanner string nextline after nextint
Java
2 votes144 views2 answers
Action bar spigot
Java
29 votes116 views3 answers
Array of char to string in java
Java
0 vote127 views1 answer
Increasing the element without any replacement in java program
Java
0 vote155 views1 answer
Quartz spring maven driver
Java Spring
1 vote128 views1 answer
Count vowels in a string java
Java
0 vote138 views2 answers
Hibernate onetone with mapsid
Java
1 vote144 views3 answers
Sorting an ArrayList
Java
0 vote158 views1 answer
Bukkit java get player count
Java
34 votes134 views2 answers
Queue.isempty java
Java