# Java Source code: How to Add numbers inside an Array Using Recursion

Updated on October 31, 2013

## Get A Website Plus a Free Domain Name in Just 1 Hour!

Bring the new technology in your hands! Share your skills, improve and impress. Get Your Own Website and a Free Domain Name Here!

The following codes is a Java source code on adding numbers inside the array. This is just a short program and also a very simple one to illustrate how an array works in Java programming language. I will also upload the code that uses for loop so that you can compare source codes on which you prepare the most, though in my own opinion I prepare looping in for loop but for the sake of knowledge lets learn another looping mechanism which is recursion. Here is the codes,

Java Source code: How to Add Numbers inside an Array Using Recursion

```//Java source codes on adding numbers inside the array using recursion

//java class

public class Array
{
public static int array( int[] arr, int first, int last)
{
//  int sum = 0;
if(arr[first] == arr[last])/* must be if(first == last),but try this one too, study the code, it is interesting */
{
return arr[first];
}
else
{
return arr[first] + array(arr, first+1, last);

}

}

}

//main class

import java.util.Scanner;

public class Main
{

public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
System.out.print("Enter the size of the input you want to enter: ");
int size = input.nextInt();
int[] numArr = new int[size];

System.out.print("Enter "+ size +" numbers: ");
for(int i=0; i<numArr.length; i++)
{
numArr[i]=input.nextInt();
}

System.out.print("The sum of the numbers is: "+   Array.array(numArr, 0 , size-1) );

}
}
```

Sample Output

Enter the size of the input you want to enter: 5

Enter 5 numbers: 3 46 50 34 150

The sum of the numbers is: 283

Since, I used static on my java method, I did not declare an object to call the class Array on the main class to access the method, simply code it on that way and it will run.

## Popular

3

7

• ### Programming in Java Netbeans - A Step by Step Tutorial for Beginners: Lesson 6

8

0 of 8192 characters used
• Johnf622

6 years ago

Just wanna input on few general things, The website pattern is perfect, the subject material is real excellent. Believe those who are seeking the truth. Doubt those who find it. by Andre Gide. bgdfagcedeea

• Mackel Kroj

7 years ago

Dear Aisha, you can get solve this issue with out development team i am giving you link of for you help for our developers.

http://www.imensosoftware.com/

• AUTHOR

Rasna Aisha

8 years ago from Manila, Philippines

@ John

Thanks for stopping by, I will check it out :)

@dwachira

Nah, lols, no, I am just a wannabe programmer. But well, I wish I could teach in the future, thanks for voting it up, sharing and rating it dwachira. ;)

• Danson Wachira

8 years ago from Nairobi, Kenya

Mastering how to work with loops and arrays is a must for the would be programmers. I'm glad you shared these basics here. By the way, could you be teaching Java? Just curious. Voted up, useful and shared.

• AUTHOR

Rasna Aisha

8 years ago from Manila, Philippines

Hi CovexLy,

You're right actually, the base case should be like that.

But I suggest that you please try the codes above, try to enter numbers that the first index and the last index are the same,it will give you the right answer as if the algorithm is correct.

Nah, recursion is really interesting, I entered the numbers you have given above and the program answers 87 which is right and another group of numbers.

1 2 3 2 1

Though I overlooked that if statement, but this is fun, hope you'll share you expertise, please do reply back...

For other java programmers, you may want to participate in this and give your ideas, that would be really highly appreciated.

By the way, Thank you covexly for stopping here and commenting...:)

• CovexLy

8 years ago

Hey, i was looking through this and i found an error(?) in the code.

Doesn't this:

if(arr[first] == arr[last])

screw up if you for example choose: 15 22 35 15

whereas the first and the last number is the same?

Or in any case where the last number is the same as any other number.

I believe it oughta be something like:

if(first == last)

working