Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, especially analysis of algorithms, amortized analysis finds the average running time per operation over a worst-case sequence of operations. Amortized analysis differs from average-case performance in that probability is not involved; amortized analysis guarantees the time per operation over worst-case performance.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.