Skip to content
Maennche Software Development logo
  • Home
  • Marketing
    • Marketing – vCMO
  • Expertise
    • Development
      • Software Development
      • Salesforce Development
      • WordPress Plugin Development
      • Full-Stack Web Development
    • Automation
    • Business Coach
    • About Matthew Maennche
  • Blog
  • Solution Maps
    • C++ Solution Map
    • Java Solution Map
    • Python Solution Map
    • Visual Basic Solution Map
  • FAQ
  • Contact
  • Log In
×
  • Home
  • Marketing
    • Marketing – vCMO
  • Expertise
    • Development
      • Software Development
      • Salesforce Development
      • WordPress Plugin Development
      • Full-Stack Web Development
    • Automation
    • Business Coach
    • About Matthew Maennche
  • Blog
  • Solution Maps
    • C++ Solution Map
    • Java Solution Map
    • Python Solution Map
    • Visual Basic Solution Map
  • FAQ
  • Contact
  • Log In

Write a method called fact that recursively calculates the factorial value of its single int parameter. The value returned by fact is a long.

LANGUAGE: JAVA

CHALLENGE:

Write a method called fact that recursively calculates the factorial value of its single int parameter. The value returned by fact is a long.

SOLUTION:

public long fact(int n) {
   if (n <= 1){
      return 1;
   }else{
      return (fact(n-1) * (long) n);
   }
}

Posted in Java, Learn To Code

Posts navigation

← Write a method called makeLine. The method receives an int parameter that is guaranteed not to be negative and a character. The method returns a String whose length equals the parameter and contains no characters other than the character passed. Thus, if the makeLine(5,’:’) will return ::::: (5 colons). The method must not use a loop of any kind (for, while, do-while) nor use any String methods other than concatenation. Instead, it gets the job done by examining its parameter, and if zero returns an empty string otherwise returns the concatenation of the specified character with the string returned by an appropriately formulated recursive call to itself.
The sum of the numbers from 1 to n can be defined recursively as follows: The sum from 1 to 1 is 1. The sum from 1 to n is n more than the sum from 1 to n-1. Write a int -method named sum that accepts an int parameter, n, and recursively calculates and returns the sum of the numbers from 1 to n. →

Additional Resources

Account

Frequently Asked Questions

Privacy Policy

Terms and Conditions

Matthew Maennche logo icon

Get In Touch!

1216 E. Kenosha St Suite 273, Broken Arrow, OK 74012

(918) 352-6109

© 2017 - 2023 Maennche Software Development. All Rights Reserved.

Scroll To Top