Write a recursive algorithm that counts the number of times the integer 0 appears in a list of integers. Write a recurrence for the algorithm and solve it.
Printable View
Write a recursive algorithm that counts the number of times the integer 0 appears in a list of integers. Write a recurrence for the algorithm and solve it.
[ Moved to its own thread - please do not hijack other threads; new problems should be posted in a new thread ]
As I said before, we can help you learn, not do your homework for you. What progress have you made towards solving this and where are you stuck?
ok fine i ll repost in new thread and more over these are not my homework problems. i am new to coding becz my background s biology. i m learng algorithms fr my thesis work. Hope u under stand
something like that?
Code:void cntZeros(int *a, int len, int *cnt, int* index){
if(a[index]==0) *cnt++;
index++;
if(*index<len)cntZeros(a, len, cnt, index);
return;
}
Welcome to the forum and thanks for your constructive comment. That will work, of course, but perhaps we are subtly suggesting he give the problem a try himself. :-) [But it's fine that you responded!]
Also! A helpful forum trick: if you surround your code with [code] and [/code] blocks, it will preserve formatting. I've modified your post to show you how it woks.