Question: Count ways to reach the nth stais..it is an algorithm problem..solve this problem in apply Divide and conquer..use C language..please solve as soon as possible..
Count ways to reach the nth stais..it is an algorithm problem..solve this problem in apply Divide and conquer..use C language..please solve as soon as possible..
There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs at a time. Count the number of ways, the person can reach the top.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
