# Amortized cost of decimal counter

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?

• 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. Jul 5 '16 at 16:19
• @DavidRicherby We may want to look beyond Big-Oh.
– Raphael
Jul 5 '16 at 16:28
• 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!
– Raphael
Jul 5 '16 at 16:28