title: Time complexity for comparing two numbers
body: <p>I'm trying to establish the time complexity of an algorithm that involves comparison of numbers.</p>
  
  <p>Say I have two numbers A and B, where both numbers have N number of digits individually. Assume it also holds that A&lt;=K and B&lt;=K.</p>
  
  <p>Now I want to compare if A&lt;=B (if A is less than or equal to B).</p>
  
  <p>I suspect that the time complexity is either O(N) or O(K).</p>
  
  <p>What is the correct time complexity?</p>