Beacon's blog

By Beacon, history, 2 months ago, In English
 
 
 
 
  • Vote: I like it
  • +161
  • Vote: I do not like it

»
2 months ago, # |
  Vote: I like it +47 Vote: I do not like it

Classic tutorial.

»
2 months ago, # |
  Vote: I like it +30 Vote: I do not like it

Strange... it's almost as if the tutorial links itself...

»
2 months ago, # |
Rev. 2   Vote: I like it +67 Vote: I do not like it
»
2 months ago, # |
  Vote: I like it +16 Vote: I do not like it

then what's the base condition

  • »
    »
    7 weeks ago, # ^ |
      Vote: I like it +37 Vote: I do not like it

    the base case is you getting so bored that you close the tab

»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

This is an infinite recursion.

When we're doing Competitive Programming, we do not use an infinite recursion usually.

»
2 months ago, # |
  Vote: I like it +9 Vote: I do not like it

I'm sorry but for some weird reasons I'm running into this error:stack-buffer-overflow. Please fix it!