Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7643563
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 31, 20262026-05-31T09:28:49+00:00 2026-05-31T09:28:49+00:00

The project is to write a recursive method that prints the parameters and return

  • 0

The project is to write a recursive method that prints the parameters and return along each step.
Here’s what I have so far:

public static int summation(int lower, int upper){
    if (lower > upper)
        return 0;
    else{
        System.out.println("Current lower bound: " + lower);
        System.out.println("Upper bound: " + upper);
        return lower + summation(lower+1, upper);
    }

Its almost perfect, the only thing it’s missing is printing the return every time. How do make it do that?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-31T09:28:50+00:00Added an answer on May 31, 2026 at 9:28 am

    How about this:

    public static int summation(int lower, int upper){
        if (lower > upper) {
            System.out.println("Returning: 0");               // print before return
            return 0;
        } else{
            int result = lower + summation(lower+1, upper);
    
            System.out.println("Current lower bound: " + lower);
            System.out.println("Upper bound: " + upper);
            System.out.println("Returning: " + result);       // print before return
            return result;
        }
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm trying to write a project that will have some autonomous components. One of
I'm required to write documentation for my current project that lists all .c files
I have a project that used to be under SVN, but now I'm moving
I'm doing background research for a project to write a software tool that converts
I have been given an end of term project to write an assembly code
I am trying to write a project using the code-first approach and I have
I have taken a project to write an adware (not spyware! this is ethical
I need to write an autoupdate script for our project. I have everything, except
The project is poorly defined: we are to write educational software for CS 111
For a project I need to read and write ESRI shapefiles. It should be

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.