All language subtitles for 5. Total Even Numbers in a Sequence - Question

All right, welcome back to additional exercise in our programming course, who we are getting better

and better every hopefully every day.

OK, so what this exercise is all about.

All right.

So we are talking about recursions and this exercise.

As well as probably the next one are going to be pretty much the same or not the same, but they are

going to be very similar, but actually different, OK, because you will have to think what is the

difference in their solution, although the question is going to be pretty much very similar, but the

solution has to be very precise.

So with that being said, I hope you already grab something nice to bring beforehand.

And let's start our practice, our recursion practice.

OK, so what do we have to do now is to write a recursive recursive function that will calculate and

return the total number.

The total number are the total total number of occurrences or occurrences of even numbers in a sequence.

OK, so once again, we will have a sequence of numbers that the user will specify, OK, up until this

stopping condition, up until minus one.

So the user is going to insert different numbers one after the other and we are going to read it and

to calculate what is the total number of occurrences of even numbers in this sequence.

So, for example, let's make something simple.

For example, we have this sequence like one, three, four, six.

OK, then for this sequence, the function, this recursive function, basically with this stopping

condition for this sequence, the function should return the value of two and why we want to return

the value of two, because we know that one is not even three is not even four is even.

That's why we have at least one even value in our section when we read the next element.

And that six six is also an even number.

That's why we know we have two two even numbers in this sequence.

So the minus one will be used for the stopping condition.

And then like we've seen it previously, we are going to make some recursive calls, recursive functions

and so on and so forth.

We are going to receive finally the number of the total amount of numbers which are even in this sequence.

So I hope the instructions are clear and let's start working, try it on your own and only then watch

the solutions.

Good luck, guys.