How to solve this algorithm, math homework help
How to solve this algorithm, math homework help
Consider the following algorithm.
for i {1, 2, 3, 4, 5} do |
|||||
![]() |
beep | ||||
| for
j |
|||||
| beep | |||||
| for
k |
|||||
![]() |
for
l |
||||
| beep | |||||
| for
m |
|||||
![]() |
![]() |
beep | |||
How many times does a
beep statement get executed?
2. Consider the following algorithm.
| x ← 1 | |||
| for
i |
|||
![]() |
for
j |
||
|
x ← x + x |
|||
| for
k |
|||
x ← x + 1 |
|||
![]() |
x ← x + 5 |
||
Count the number of + operations done by this algorithm.

{1, 2, 3, 4, 5}

