Thread: Recursive function returning 0

This function return the sum of the numbers that are bigger than k. I understand all of its logic but iam confused with return 0. Say we have k = 9, so we adding numbers until tam ==0, but by returning 0 shouldn't we lose the value that we accumulated? How come the function return the sum and zero at same time?

Code:

#include <stdio.h>

int SumBiggerThanK(int k, int a[], int size)
{
	if(tam==0)
	{
		printf("GOT HERE");
		return 0;
	}
	else if(a[size-1]>=k)
	{
		return a[size-1] + SSIK(k, a, size-1);
	}
	else
	{
		return SSIK(k, a, size-1);
	}
}


int main()
{
	int a[]={9, 18, 31, 40, 42};
	
	printf("%d\n", SumBiggerThanK(9,a, 5));
}

sorry

Code:

#include <stdio.h>

int SumBiggerThanK(int k, int a[], int size)
{
	if(size==0)
	{
		printf("GOT HERE");
		return 0;
	}
	else if(a[size-1]>=k)
	{
		return a[size-1] + SumBiggerThanK(k, a, size-1);
	}
	else
	{
		return SumBiggerThanK(k, a, size-1);
	}
}


int main()
{
	int a[]={9, 18, 31, 40, 42};
	
	printf("%d\n", SumBiggerThanK(9,a, 5));
}

Function is good i just don't understand the return 0. When it does return 0 it can quit the function and at the same time return the value that accumulated?

Originally Posted by telmo_d

Function is good i just don't understand the return 0. When it does return 0 it can quit the function and at the same time return the value that accumulated?

It returns '0' at the end of the recursion - when there are no more numbers in the array that need to be evaluated against 'k'.

The '0' is added to the values got in the recursions.

I was thinking it would ignore the rest and turn out a '0'
Now it makes perfect sense, thanks.

Originally Posted by telmo_d

This function return the sum of the numbers that are bigger than k. I understand all of its logic but iam confused with return 0. Say we have k = 9, so we adding numbers until tam ==0, but by returning 0 shouldn't we lose the value that we accumulated? How come the function return the sum and zero at same time?

It seems like you mean to get the sum of the number that are greater than 'k', right ?

If yes, then you should have

Code:

 else if(a[size-1]>k)

instead of :

Code:

 else if(a[size-1]>=k)