title: Count number of possible paths up ladder
body: <p>I can't seem to come up with an algorithm to solve the following problem, I tried using a series of for-loops but it became way too complicated: </p>
  
  <blockquote>
    <p>A ladder has <code>n</code> steps, one can climb the ladder using any
    combination of steps of 1 or steps of 2. How many possible ways are
    there for one to climb the ladder?</p>
  </blockquote>
  
  <p>So for example, if the ladder had <strong>3 steps</strong>, these would be the possible paths:  </p>
  
  <ul>
  <li>1-1-1   </li>
  <li>2-1   </li>
  <li>1-2</li>
  </ul>
  
  <p>And for <strong>4 steps</strong>  </p>
  
  <ul>
  <li>1-1-1-1   </li>
  <li>2-1-1   </li>
  <li>1-2-1   </li>
  <li>1-1-2   </li>
  <li>2-2</li>
  </ul>
  
  <p>Any insight as to how this could be done would be greatly appreciated. Also, I'm working in Java.</p>
  
  <p>Edit: I was indeed going to be using small <code>n</code> values, but it certainly would be neat to know how to manage with larger ones.</p>