All language subtitles for 15. Very Ascending or Not - Question

All right, so welcome back to another video in our programming course in this video we are going to

do it's not going to be an easy exercise, but I think we are going to be just fine.

So what do we have to do here is to write a program that receives a size value from the user, just

some value.

OK, and once we receive this value, the program should read a sequence.

All right.

So a sequence of size numbers and check if the numbers are very ascending or not.

So basically, what we have to do is, for example, we received size equals to seven, OK, size equals

to seven.

Then in this case, what we have to do is simply to run the input function and read the value, some

value from the user.

So the first value is going to be one.

The second value is going to be nine, 14, 15 and so on and so forth.

OK, so here it's not 13.

It should be 18.

OK, so a team.

OK, so it's 18, 18.

Then read this value, this value and this value.

And finally, the program should print if this sequence is very ascending or not.

And that means that every time that we get a value, it must be greater than the previous one.

So we know nothing is greater than one, 14 is greater than nine and so on.

So basically you can do like this.

OK, so 14 is greater a greater, a greater, greater and greater.

And if that's the case, the program should print various sending.

OK, that we will see right away.

So this is very sending.

But for example, if we received size equals to three, just just another example, then in this case

we can see that we get two and then we get one.

OK, so all the values that we are getting are simply represented from the left to the right in this

case.

So two is the first number and then we get one and we can say absolutely that one is not greater than

two.

Then we know that this sequence will be not very ascending.

Right.

So this what do you have to do?

That's not an easy exercise.

Most often most of the time, most people that do this exercise for the first time, they have at least

here or there, a small mistake.

So my recommendation is give it some time because it's not so trivial to solve it.

And also, my another request is that since we are proceeding and becoming better programmers, there

is a chance that you have to start thinking about optimizing your solutions.

So if, you know, let's say you have to solve this exercise once again in two ways, the first wave

will be the trivial solution and the second way should be kind of a little bit more optimized option,

a little bit more optimized solution.

And once you are done solving and you found two optional solutions, feel free to check that it works

exactly as you expected and then to compare your results with my results of this video.

So, as always, thank you guys for watching.

Go practice it.

My name is Vlad and this is Alphatech.

OK, so Alphatech, that's where you are.

So until next time.

Until the solution video.

I'll see you then.