Math Is Fun Forum
  Discussion about math, puzzles, games and fun.   Useful symbols: √ ∞ ≠ ≤ ≥ ≈ ⇒ ∈ Δ θ ∴ ∑ ∫ π -




Not registered yet?

Post a reply

Go back

Write your message and submit
:) :| :( :D :o ;) :/ :P :lol: :mad: :rolleyes: :cool: | :dizzy :eek :kiss :roflol :rolleyes :shame :down :up :touched :sleep :wave :swear :tongue :what :faint :dunno

Go back

Topic review (newest first)

2011-05-30 17:28:23

If a = b then it will execute 1 time.

Use the formula, if a = b and c =d then the body will be executed:

( b - a + 1 ) ( d - c + 1 ) = ( 0 + 1) ( 0 + 1 ) = 1 time

And wait, I forgot to mention this. Why are you asking this question? All you have to do to answer this for yourself is program two loops and put a print statement between them. You are both missing the whole point of programming. It is to answer experimentally, questions like this.

2011-05-30 17:23:57

hiya. thanks for welcoming me big_smile, this place is cool.

I'm not clear with, if a=b, c=d, what will happen to the loop?

thanks again

2011-05-30 17:13:31

Hi umasou;

Welcome to the forum! There is still a unique answer. The body of the loops will executed ( b - a + 1 ) ( d - c + 1 ) times.

This is assuming an increment of 1.

2011-05-30 17:09:19

I have the same problem but different different values [assume a,b,c,d are all +ve]:

assume a ≤ b and c ≤ d

for j= a to b
   for h = c to d
        [Statements in body]
   next h
next j

yikes hmm..should there be more than 1 answer..?

2011-05-05 15:02:37

Hi mantastrike;

The innermost k loop goes from 1 to m. If a loop goes from 1 to 5, that is 5 times. If it goes from 1 to 100, that is 100 times. If it goes from 1 to m that is m times.

Now the j loop goes from 1 to n. That is n times. Each time the j loop counts once the k loop goes m times.

So the two inner loops are n*m

The i loop goes from 1 to 17. Each time the i loop executes the j and  k loop execute n*m

So all three loop s are 17 * n * m

2011-05-05 14:54:20

gAr wrote:

can u plz tell me how you got this? can u plz show work?

2011-05-03 03:13:40

2011-05-02 22:37:40

How many times will the innermost loop of the following algorithm be run? Assume n and n and k are positive integers.

Please help me with this with a detailed answer. You don't have to explain but please show some working.

for i : = 1 to 17
            for j: = 1 to n
                  for k: = 1 to m
                              [Statements in body]
                    next k
              next j
next i

Please help me guys! THANK YOU!!

I love this forum for being a great help!

Board footer

Powered by FluxBB