Breaking News: Grepper is joining You.com. Read the official announcement!

2 multiples

Mero answered on July 30, 2021 Popularity 6/10 Helpfulness 1/10

answer 2 multiples

2 multiples

Comment

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);
    }

}

Popularity 6/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: java recursion

Link to this answer
Share Copy Link

Contributed on Jul 30 2021

Mero

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

2 multiples

Contents

More Related Answers

2 multiples

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.