 That is, the amortized time is defined to be the actual time taken by the operation plus "C" times the difference in potential caused by the operation.When studying asymptotic computational complexity using big O notation, constant factors are irrelevant and so the constant "C" is usually omitted.Despite its artificial appearance, the total amortized time of a sequence of operations provides a valid upper bound on the actual time for the same sequence of operations.