Thread: Help with my recursion

Code:

#include <iostream>

using namespace std;

int countZero(int a[], int count);


void main(void)
{
	int size = 10;
	int Myarray[10] = {6, 0, 0, 7, 9, 3, 8, 2, 1, 8};
	
	cout << "The numbers of zero in the array is " ;
	cout << countZero(Myarray, size);
	cout << endl;
	system ("pause");
}


int countZero(int a[], int count)
{
	int s = 0;
	if (count == 1)
	{
		if (a[count] == 0)
		{
			s ++;
		}
		else
		{
			countZero(a, count - 1);
		}
		
	}
	else
	{
		countZero(a, count - 1);
	}
	
	return s;
}

I am doing a code where the recursion function count the number of zero in an array, but the recursive function did not work well. What is wrong with my code, some1 help me, thank you.

hmm, i still a bit unclear how to implement the recursive function. I already added the count - 1 to check all the array to get the number of zero but somehow the recursive does not work.

Hmm, is my recursive function now what I am coding is completely wrong . Where is the part I need to edit

Code:

#include <iostream>

using namespace std;

int countZero(int a[], int count);


void main(void)
{
	int size = 10;
	int Myarray[10] = {6, 0, 0, 7, 9, 3, 8, 2, 1, 8};
	
	cout << "The numbers of zero in the array is " ;
	cout << countZero(Myarray, size);
	cout << endl;
	system ("pause");
}


int countZero(int a[], int count)
{
	int s = 0;                            //s to count the number of zero in an array
	if (count != 0)
	{
		if (a[count - 1] == 0)
		{
			s ++;                          //to count the number of zero in an array
			countZero(a, count - 1);
		}
		else
		{
			countZero(a, count - 1);      //go back to the function
		}
		
	}
	else
	{
		if (a[count - 1] == 0)
		{
			s ++; 
		}
	}
	
	return s;                               //return the number of zero back to the function
}

This is my latest code. The output print 0 when it should be printing 2 instead. What is wrong with my recursion?

cant work , i received this error "recursive on all control paths, function will cause runtime stack overflow" . hmm i am stuck in this question

No, i did try but still cant get it right. My recursion is quite weak.

Code:

#include <iostream>

using namespace std;

int countZero(int a[], int count);


void main(void)
{
	int size = 10;
	int Myarray[10] = {6, 0, 0, 7, 9, 3, 8, 2, 1, 8};
	
	cout << "The numbers of zero in the array is " ;
	cout << countZero(Myarray, size);
	cout << endl;
	system ("pause");
}


int countZero(int a[], int count)
{
	if (count < 1)
	{
		if (a[count - 1] == 0)

		{
			return 1 + countZero(a, count - 1);
		}
		else
		{
			return 0 + countZero(a, count - 1);
		}
	}
	else
	{
		return 0;
	}

}

My latest code, still got problem.

Code:

#include <iostream>

using namespace std;

int countZero(int a[], int count);


void main(void)
{
	int size = 10;
	int Myarray[10] = {6, 0, 0, 7, 0, 3, 0, 2, 1, 8};
	
	cout << "The numbers of zero in the array is " ;
	cout << countZero(Myarray, size);
	cout << endl;
	system ("pause");
}


int countZero(int a[], int count)
{
	if (count > 1)
	{
		if (a[count - 1] == 0)

		{
			return 1 + countZero(a, count - 1);
		}
		else
		{
			return 0 + countZero(a, count - 1);
		}
	}
	else
	{
		return 0;
	}

}

Yes, it finally work, some carless mistake on that count. Haha thank you, my final code.