Algorithm array analysis using random inspections
This article examines two methods of analysis software algorithms. The first of these is based on the mechanism of recursion chain (chain recurrences). This method has the potential to greatly simplify the task of analysis in the case of the possibility of presenting the program as a basic recursion (base recurrence), which allows you to submit an expression of a cycle in the form from which you can get the value of the expression on the i-th iteration is O (1). Since at the present time, this problem is not solved, the program analysis method based on recursion chains may be applied only in a limited number of programs (it should be said that the number of such programs is large), where there are no complicated cycles and expressions for them. The second way - it is an algorithmic method of analysis. The article describes a group of algorithms, which can be used to perform checks of relations over / under on any array in the program. As testing sorting algorithm was used insert. The above review team consists of algorithms determine how the algorithm in the program (it being understood that the paths are built on the basis of that return control edges of the graph (control flow graph) are included in each path only once), algorithm analysis investigated the relation to the program. Last algorithm assumes data pre-processing, which is not considered in the article, but it is quite simple, as well as the ratio of the scan on the entire length of the array, without regard to its constituent parts. checking algorithm can be modified (base portion is retained) for checking other types of relations.