# When do you use amortized time complexity and when to use unamortized?

This is my guess:

-Use amortized because we want to know the "averaged" complexity over n operations assuming the operation is going to be used frequently

-Use unamortized when you know the operation is going to be used rarely

• (try spaces following the dashes of a list) There is late answers are wrong answers: real time processing. – greybeard Nov 6 '20 at 16:41
• I just did and I got bullet points as hyphens and some kind of blocks around the words. PS: I have no idea what you're saying after the parenthesis – Leo Nov 6 '20 at 23:25
• I have no idea … Nothing to be ashamed of - or proud. en.wikipedia: Real-time processing fails if not completed within a specified deadline relative to an event; deadlines must always be met, regardless of system load. – greybeard Nov 7 '20 at 7:26

## 1 Answer

You can find the motivation for the amortized analysis from this reference:

The motivation for amortized analysis is that looking at the worst-case time per operation can be too pessimistic if the only way to produce an expensive operation is to "set it up" with a large number of cheap operations beforehand.

Hence, unamortized (asymptotic) analysis means considering time complexity of an algorithm (instead of each operation) when each operation can be counted in constant time.