Reduction in Complexity of the Algorithm by Increasing the Used Memory - An Example

Abstract

An algorithm complexity, or its efficiency, meaning its time of evaluation is the focus of primary care in algorithmic problems solving. Raising the used memory may reduce the complexity of algorithm drastically. We present an example of two algorithms on finite set, where change the approach to the same problem and introduction a memory array allows decrease the complexity of the algorithm from the order O ( n 2 ) up to the order O ( n ).