Sum of array elements using recursion | GeeksforGeeks

This video is contributed by Harshit Verma

Please Like, Comment and Share the Video among your friends.

Also, Subscribe if you haven't already! :)

[graceonuoha]

You don't know what you've done for me by posting this video. Thank you.

[paramrajsinghchadha]

Best explanation so far. Simple and to the point.

[nm]

hi there
I want to ask you about this example...
what is the best case and the worst case (time complexity)

[incodewetrust]

my teacher says Taking inspiration from the principle of binary (i guess like in binary search) find the sum of array of n elements, so i know the size of the array with your video i can do it but i don' understand how can i use binary here ?? if divide n/2 each recursion i won't get the sum right

[shivanshmittal]

Sir, can you provide a video on finding sum of squares of array elements using recursion.

[saurabhbanerjee]

Can you tell how it would work if size of array is not passed to function

[mdaabedqureshi]

Sir microprocessors me sum of array element project banao
Koi bhi nahi banaye abhi tak

[punleu_sam]

sorry sir. please detail about recursive again sir

[rifathossain]

sank you very much sir, I learn aloot from video sir

[AshishRanjan-juzk]

class Test{
public static void main(String[] args) {
int a[]={1, 5, 3, 4, 2};
int x=0;
int sum=recurcivelySum(a, x);
System.out.println("sum "+sum);
}
private static int recurcivelySum(int[] a, int x) {
if(x==a.length-1){
return a[x];
}
return a[x]+recurcivelySum(a, ++x);

}

}