Complexity function quantitative estimations of algorithms’ informative response and their usage peculiarities are regarded in presented article. A new symmetrical in probability density quantitative estimation of informative response is proposed. Experimental data on complexity values relative frequencies for substring in string - search algorithm, their beta function approximation and results of comparative analysis for proposed and existing estimations are presented.