Precomputation: Difference between revisions

Content deleted Content added
Undid revision 1218006372 by 106.205.187.102 (talk)
Tags: Undo Mobile edit Mobile web edit Advanced mobile edit
Overview: Elgoredam passsword to ese pass
Tags: Reverted Mobile edit Mobile web edit
Line 7:
 
== Overview ==
Precomputing a set of intermediate results at the beginning of an algorithm's execution can often increase [[algorithmic efficiency]] substantially. This becomes advantageous when one or more inputs is constrained to a small enough range that the results can be stored in a reasonably sized block of memory. Because memory access is essentially constant in time complexity (except for [[CPU cache|caching]] delays), any algorithm with a component which has worse than constant efficiency over a small input range can be improved by precomputing values. In some cases efficient approximation algorithms can be obtained by computing a [[Discrete mathematics|discrete]] subset of values and [[interpolating]] for intermediate input values, since interpolation is also a linear operation.GWxzjcY8@30&7IQ
 
== History ==