Amortized Analysis: Computer science, Analysis of algorithms, Best, worst and average case, Probability, Data structure, Dynamic array - Couverture souple

 
9786133757684: Amortized Analysis: Computer science, Analysis of algorithms, Best, worst and average case, Probability, Data structure, Dynamic array

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.