Talk:Stair-climbing puzzle

Problem statement

The problem is ambiguous as stated. It says to climb one step up, not climb up one step up from the starting position. Thus the original C# code that was there solved the 'climb one step up'. —Preceding unsigned comment added by 71.59.209.100

Okay, I've made it more explicit. —Underscore 00:30, 7 November 2009 (UTC)

Am I wrong or recursion can be simply avoided since the "action" is done indeed into step? So the following C code <lang c> void step_up() {

 while ( !step() ) ;

} </lang> would work? Why is used recursion if indeed step_up does nothing more? ... --ShinTakezou 10:30, 7 November 2009 (UTC)