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(n2)
up to the order O(n).
References
[1]
T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, \"Introduction to Algorithms\", 3rd Edition, MIT Press, Cambridge, MA, 2009.
[2]
M. A. Weiss, \"Data Structures and Algorithm Analysis in C,\" Addison-Wesley, 1997.
[3]
G. L. Abdulgalimov and L. A. Kugel and N. A. Masimova, \"To the Question About Teaching Designing of Information Systems and Data Analysis\", Science and Education,\" No. 9, 2012. pp 81-82 (in Russian).
http://elibrary.ru/item.asp?id=18251112
[4]
G. L. Abdulgalimov, S. M. Yevstigneev and L. A. Kugel, \"Analysis of the Data for Teaching the Basics of Programming\", Proceedings of the X National Russian Conference \"IT Education in the Russian Federation\", 16-18 May 2012, Moscow, Moscow State University, pp 273-275 (in Russian).
http://2012.xn----8sbacgtleg3cfdxy.xn--p1ai/upload/IT-EDUCATION-2012-book.pdf
