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
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.
Sign up to join this communityThis 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
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.
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. $\endgroup$ – greybeard Nov 7 '20 at 7:26