%0 Journal Article
%T Reduction in Complexity of the Algorithm by  Increasing the Used Memory - An Example
%A Leonid Kugel
%A Victor A. Gotlib
%J American Journal of Computational Mathematics
%P 38-40
%@ 2161-1211
%D 2013
%I Scientific Research Publishing
%R 10.4236/ajcm.2013.33B007
%X <p class=\"MsoNormal\">
	<span lang=\"EN-US\">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<i> O</i>(<i>n</i><sup>2</sup>)
up to the order <i>O</i>(<i>n</i>).</span>
</p>
%K Algorithm
%K Complexity Reduction
%K Memory Usage
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=38521