I think it's fibonacci series... T(n)= T(n-1) + T(n-2) Explanation: T(n): no. of ways for n stairs
T(n-1): when it took the first step as 1 stair t(n-2): when it took the first step as 2 stairs the series can be started as T(1)=1 T(2)=2 and calculate the rest from above On Sat, Aug 13, 2011 at 8:37 PM, Gaurav Menghani <[email protected]>wrote: > Knapsack DP > > On Sat, Aug 13, 2011 at 8:35 PM, Kamakshii Aggarwal > <[email protected]> wrote: > > yes > > > > On Sat, Aug 13, 2011 at 8:30 PM, Puneet Goyal <[email protected]> > > wrote: > >> > >> 1 or 2 stairs? > >> > >> On Sat, Aug 13, 2011 at 8:24 PM, Kamakshii Aggarwal > >> <[email protected]> wrote: > >>> > >>> Given n stairs, how many number of ways can you climb if u use either 1 > >>> or 2 at a time? > >>> -- > >>> Regards, > >>> Kamakshi > >>> [email protected] > >>> > >>> -- > >>> You received this message because you are subscribed to the Google > Groups > >>> "Algorithm Geeks" group. > >>> To post to this group, send email to [email protected]. > >>> To unsubscribe from this group, send email to > >>> [email protected]. > >>> For more options, visit this group at > >>> http://groups.google.com/group/algogeeks?hl=en. > >> > >> > >> > >> -- > >> ----------------------------------------------------------------------- > >> Puneet Goyal > >> Student of B. Tech. III Year (Software Engineering) > >> Delhi Technological University, Delhi > >> ----------------------------------------------------------------------- > >> > >> -- > >> You received this message because you are subscribed to the Google > Groups > >> "Algorithm Geeks" group. > >> To post to this group, send email to [email protected]. > >> To unsubscribe from this group, send email to > >> [email protected]. > >> For more options, visit this group at > >> http://groups.google.com/group/algogeeks?hl=en. > > > > > > > > -- > > Regards, > > Kamakshi > > [email protected] > > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to [email protected]. > > To unsubscribe from this group, send email to > > [email protected]. > > For more options, visit this group at > > http://groups.google.com/group/algogeeks?hl=en. > > > > > > -- > Gaurav Menghani > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- ----------------------------------------------------------------------- Puneet Goyal Student of B. Tech. III Year (Software Engineering) Delhi Technological University, Delhi ----------------------------------------------------------------------- -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
