You Should Be Able To Solve This

File: 1455955504476.png (53KB, 240x193px) Image search: [Google]

53KB, 240x193px

What is the value sent to the parameter n

You right I forgot to mention that! n is set to 5.

Depends on the OS.

Depends on how wide the type "int" is and if you have enough memory to hit integer overflow before stack overflow.

File: 1472350607676.jpg (61KB, 486x459px) Image search: [Google]

61KB, 486x459px

>>1521485
>ShowMessage(n+1);
If n is set to 5, then the message will show 6 times

>>1521495
Assume we're running a Turing machine with 5 miles of tape.

until the computer runs out of memory or there is an integer overflow right? it just keeps printing the message on and on

>>1521960
i mean a stack overflow would happen before either of those i think, i am a brainlet...

If it stack overflows it's just going to go all the way back to negatives and work it's way up again.

>>1521963
no it isn't, n > 0

O, didn't read.
If int is 2 bytes then 2^16 / 2 - 1 will be the max iterations
If int is 4 bytes then 2^32 / 2 - 1 will be the max iterations

>>1521968
Oh wait... it can only start from 1 so it's probably -2... IDK...

>>1521485