Can somebody tell me what the lowest amortized cost for the increment operation of a decimal counter is?

I can show the costs are O(1) and with max amortized costs of 2 (similar to a binary counter), but is this the lowest possible value?

  • 2
    $\begingroup$ I'm not sure what you're asking. Every increment must require at least one operation so you can't possibly get better than $O(1)$, which is what you've got. $\endgroup$ Jul 5 '16 at 16:19
  • $\begingroup$ @DavidRicherby We may want to look beyond Big-Oh. $\endgroup$
    – Raphael
    Jul 5 '16 at 16:28
  • $\begingroup$ The title you have chosen is not well suited to representing your question. Please take some time to improve it; we have collected some advice here. Thank you! $\endgroup$
    – Raphael
    Jul 5 '16 at 16:28

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.