$$ \newcommand{\floor}[1]{\left\lfloor{#1}\right\rfloor} \newcommand{\ceil}[1]{\left\lceil{#1}\right\rceil} \renewcommand{\mod}{\,\mathrm{mod}\,} \renewcommand{\div}{\,\mathrm{div}\,} \newcommand{\metar}{\,\mathrm{m}} \newcommand{\cm}{\,\mathrm{cm}} \newcommand{\dm}{\,\mathrm{dm}} \newcommand{\litar}{\,\mathrm{l}} \newcommand{\km}{\,\mathrm{km}} \newcommand{\s}{\,\mathrm{s}} \newcommand{\h}{\,\mathrm{h}} \newcommand{\minut}{\,\mathrm{min}} \newcommand{\kmh}{\,\mathrm{\frac{km}{h}}} \newcommand{\ms}{\,\mathrm{\frac{m}{s}}} \newcommand{\mss}{\,\mathrm{\frac{m}{s^2}}} \newcommand{\mmin}{\,\mathrm{\frac{m}{min}}} \newcommand{\smin}{\,\mathrm{\frac{s}{min}}} $$

Prijavi problem


Obeleži sve kategorije koje odgovaraju problemu

Još detalja - opišite nam problem


Uspešno ste prijavili problem!
Status problema i sve dodatne informacije možete pratiti klikom na link.
Nažalost nismo trenutno u mogućnosti da obradimo vaš zahtev.
Molimo vas da pokušate kasnije.

Combining loops

We’ve seen that in the body of a for statement, we can place several different statements. Similarly to the for statement, in the while statement we can also (in addition to other commands) place a new loop statement, and it could be either a while or a for loop. That way, we can build different combinations of inserted loops.

When the two loops are inserted into one another, we call them a double loop, while three nested loops are called a triple loop. Similarly, we can nest any number of loops into one another, we just rarely need a large number of nested loops.

In this lesson we will practice writing combinations of the nested while and for loops.

Various double and multiple loops - tasks

Take 4 balls at each square until the end of a row

There are one or more squares in front of Karel, and on each of these squares there are four balls (there are no balls on the starting square). Karel needs to pick them all up.

Now, until he reaches the wall, Karel needs to repeat stepping forward and taking 4 balls. Try complementing the program.

Recall, as in the earlier examples of nesting loops, the statement in the body of the inner loop (here it will be the statement pick_ball()) should be indented further.

Please try loading this page in HTML5 enabled web browsers. All the latest versions of famous browsers such as Internet explorer, Chrome, Firefox, Opera support HTML5.

(Karel_while__many_squares_four_bals_per_square)

Pick up all the balls

There is at least one square in front of Karel, and there may be any number of them. On each of the squares in front of Karel there are zero or more balls (the starting square is empty). Karel needs to pick up all the balls.

This task is the generalization of the previous one, so the program that solves this task can be used in the previous one as well. The difference is that now the inner loop must be a while loop, while in the previous task it could have been a for loop as well.

Again, the statement pick_ball() should be indented further in. This way, it will repeat while the condition of the inner while statement holds, that is, while there is a ball on the square Karel is on at that moment. Taking all the balls, together with the move statement is repeated in the outer while loop as long as there are squares in front of Karel. The overall effect of nesting loops is that all the balls from each square will be taken.

Please try loading this page in HTML5 enabled web browsers. All the latest versions of famous browsers such as Internet explorer, Chrome, Firefox, Opera support HTML5.

(Karel_while__many_squares_many_balls)

Bring all the balls

There is a path of unknown length in front of Karel. Karel should collect all the balls from all the squares and bring them to the starting square.

The program has been broken down to smaller pieces by the comments. Add missing statements.

Please try loading this page in HTML5 enabled web browsers. All the latest versions of famous browsers such as Internet explorer, Chrome, Firefox, Opera support HTML5.

(Karel_while__bring_all_balls)

Up and down

Karel is on a rectangular board of unknown size (the number of columns is always odd), without any balls on the squares. The goal is for Karel to reach the bottom right square. In order to achieve this, Karel will have to move through the columns alternately up and down.

   These are some of the possible looks of the labyrinth:

../_images/While_UpDown.jpg

Please try loading this page in HTML5 enabled web browsers. All the latest versions of famous browsers such as Internet explorer, Chrome, Firefox, Opera support HTML5.

(Karel_while__up_col_down_col)

Stairs

Karel should climb up the first stairs, then go down the other ones and end up in the lower right corner. The table size is not known, but the number of columns will always be odd. The table might look like this:

../_images/While_Stairs.jpg

Please try loading this page in HTML5 enabled web browsers. All the latest versions of famous browsers such as Internet explorer, Chrome, Firefox, Opera support HTML5.

(Karel_while__stairs)

Spiral to the left

In all displayed cases, Karel should come to a square marked with a red circle (there are no balls in this task).

../_images/While_SpiralLeft.jpg

Please try loading this page in HTML5 enabled web browsers. All the latest versions of famous browsers such as Internet explorer, Chrome, Firefox, Opera support HTML5.

(Karel_while__spiral_left)