title: Analysis of the complexity of incrementing binary counter with a given initial content
body: <p>The key is that the binary counter has some content at the beginning. Is it still amortized constant time complexity? How to prove it?</p>
  
  <p>Let's say that we have <code>11010</code> binary counter and we increment it so it's now <code>11011</code> and so on. </p>
  
  <p>What is the amortised cost of single increment operation? </p>