The most common situation is an algorithm involving a lookup table : an implementation can include the entire table , which reduces computing time , but increases the amount of memory needed , or it can compute table entries as needed , increasing computing time , but reducing memory requirements .

The most common condition is an algorithm using a lookup table .
