-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsumOfArray.java
More file actions
54 lines (43 loc) · 1.03 KB
/
sumOfArray.java
File metadata and controls
54 lines (43 loc) · 1.03 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/* Sum Of Array
Given an array of length N, you need to find and return the sum of all elements of the array. */
package Recursion;
import java.util.Scanner;
public class sumOfArray
{
public static int arraySum(int arr[])
{
int n = arr.length;
int sum = 0;
if (n <= 0)
{
return sum;
}
int smallArray[] = new int[n-1];
for(int i=1;i<n;i++)
{
smallArray[i-1] = arr[i];
}
int smallOutput = arraySum(smallArray);
sum = smallOutput + arr[0];
return sum;
//return arraySum(arr, n-1 ) + arr[n-1];
}
public static void main(String[] arg)
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter the size of array : ");
int size = sc.nextInt();
int[] input_arr = new int[size];
for(int i=0; i<size; i++)
{
System.out.print("Enter the element at "+ i + "th term : ");
input_arr[i] = sc.nextInt();
}
for(int i= 0; i<size; i++)
{
System.out.print(input_arr[i]+ ", ");
}
System.out.println();
System.out.println("Sum of array is "+arraySum(input_arr));
}
}