
January 2nd, 2013, 02:23 PM
|
 |
Contributing User
|
|
|
|
how about this pseudocode:
Code:
int findingEvens(node L, int E)
if(null L)
return 0;
if(L->element is even)
if(null L->next)
return E + 1
else
return findingEvens(L->next, E + 1)
else
if(null L->next)
return E
else
return findingEvens(L->next, E)
|