Reputation
Next privilege 200 Rep.
See reduced ads
Badges
1 6
Newest
 Custodian
Impact
~3k people reached

  • 0 posts edited
  • 0 helpful flags
  • 20 votes cast
Nov
24
comment Is there anything that can be done with recursion that can't be done with loops?
actually, A(0,n)=n+1; A(m,0)=A(m-1,1) if m>0; A(m,n) = A(m-1,A(m,n-1)) if m>0,n>0 grows even a bit faster than O(n^n) (for m=n) :)
Nov
17
awarded  Custodian
Dec
24
awarded  Notable Question
Jan
24
comment How to get better at solving Dynamic programming problems
@Florents Tselai just saw your comment. Why do you think it's not?
Dec
8
awarded  Nice Question
Feb
22
awarded  Popular Question
Oct
21
comment Do some programmers know some secrets that we others don't?
Well, IF the guild will come after me, it will be rather for mentioning vi in vain..
Oct
21
awarded  Supporter
Oct
20
awarded  Editor
Oct
20
revised Do some programmers know some secrets that we others don't?
improved formulation
Oct
20
answered Do some programmers know some secrets that we others don't?
Oct
20
awarded  Student
Oct
17
asked The relation between Business Rules Engines and Constraint Programming languages